default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuc Longpré
- > Home > Persons > Luc Longpré
Publications
- 2023
[c25]Saeid Tizpaz-Niari, Luc Longpré, Olga Kosheleva
, Vladik Kreinovich:
Fast - Asymptotically Optimal - Methods for Determining the Optimal Number of Features. IUKM (1) 2023: 123-128- [p5]Luc Longpré, Olga Kosheleva, Vladik Kreinovich:
Baudelaire's Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations. Decision Making Under Uncertainty and Constraints 2023: 3-9 - [p4]Luc Longpré, Vladik Kreinovich:
How to Describe Hypothetic Truly Rare Events (With Probability 0). Uncertainty, Constraints, and Decision Making 2023: 211-215 - [p3]Luc Longpré, Olga Kosheleva, Vladik Kreinovich:
Additional Spatial Dimensions Can Help Speed Up Computations. Decision Making Under Uncertainty and Constraints 2023: 297-304 - 2019
- [c24]Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré:
Between Dog and Wolf: A Continuous Transition from Fuzzy to Probabilistic Estimates. FUZZ-IEEE 2019: 1-5 - [c23]Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré:
In Its Usual Formulation, Fuzzy Computation Is, In General, NP-Hard, But a More Realistic Formulation Can Make It Feasible. FUZZ-IEEE 2019: 1-6 - [p2]Songsak Sriboonchitta, Luc Longpré, Vladik Kreinovich, Thongchai Dumrongpokaphan:
Why the Best Predictive Models Are Often Different from the Best Explanatory Models: A Theoretical Explanation. Structural Changes and their Econometric Modeling 2019: 163-171 - 2014
- [c20]Luc Longpré, Olga Kosheleva, Vladik Kreinovich:
Towards the Possibility of Objective Interval Uncertainty. SCAN 2014: 54-65 - 2013
- [j41]Andrzej Pownuk, Luc Longpré, Vladik Kreinovich:
Checking Monotonicity is NP-Hard Even for Cubic Polynomials. Reliab. Comput. 18: 90-96 (2013) - 2011
- [j39]Luc Longpré, Christian Servin, Vladik Kreinovich:
Quantum computation techniques for gauging reliability of interval and fuzzy data. Int. J. Gen. Syst. 40(1): 99-109 (2011) - 2007
- [p1]Luc Longpré, Vladik Kreinovich:
How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and Confidentiality. Computational Intelligence in Information Assurance and Security 2007: 155-173 - 2006
- [j34]Vladik Kreinovich, Gang Xiang, Scott A. Starks, Luc Longpré, Martine Ceberio, Roberto Araiza, Jan Beck, Raj Kandathi, Asis Nayak, Roberto Torres, Janos G. Hajagos:
Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity. Reliab. Comput. 12(6): 471-501 (2006) - 2005
- [j33]Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg:
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. Reliab. Comput. 11(1): 59-76 (2005) - [j32]Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles:
Exact Bounds on Finite Populations of Interval Data. Reliab. Comput. 11(3): 207-233 (2005) - [j31]Vladik Kreinovich, Luc Longpré:
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). SIGACT News 36(3): 107-112 (2005) - 2004
- [j30]Vladik Kreinovich, Luc Longpré:
Fast quantum algorithms for handling probabilistic and interval uncertainty. Math. Log. Q. 50(4-5): 405-416 (2004) - [j29]Hung T. Nguyen, Vladik Kreinovich, Luc Longpré:
Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals. Reliab. Comput. 10(2): 83-106 (2004) - [j28]Roberto Torres, G. Randy Keller, Vladik Kreinovich, Luc Longpré, Scott A. Starks:
Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications. Reliab. Comput. 10(5): 401-422 (2004) - [c16]Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré:
New Algorithms for Statistical Analysis of Interval Data. PARA 2004: 189-196 - 2003
- [j27]Luc Longpré, Vladik Kreinovich:
Can quantum computers be useful when there are not yet enough qubits? Bull. EATCS 79: 164-169 (2003) - [j26]Vladik Kreinovich, Luc Longpré, James J. Buckley:
Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact? Reliab. Comput. 9(5): 349-358 (2003) - [c15]Hung T. Nguyen, Vladik Kreinovich, Luc Longpré:
Dirty pages of logarithm tables, lifetime of the universe, and subjective (fuzzy) probabilities on finite and infinite intervals. FUZZ-IEEE 2003: 67-73 - [c14]Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg:
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. LSSC 2003: 238-245 - 2002
- [j25]Vladik Kreinovich, Luc Longpré:
Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. Bull. EATCS 77: 191-194 (2002) - [j24]Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles:
Computing variance for interval data is NP-hard. SIGACT News 33(2): 108-118 (2002) - 2001
- [j23]Frank Harary, Vladik Kreinovich, Luc Longpré:
A new graph characteristic and its application to numerical computability. Inf. Process. Lett. 77(5-6): 277-282 (2001) - [c13]Hung T. Nguyen, Vladik Kreinovich, Luc Longpré:
Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. EUSFLAT Conf. 2001: 410-413 - 2000
- [j20]Raul Trejo, Vladik Kreinovich, Luc Longpré:
Choosing a Physical Model: Why Symmetries? Bull. EATCS 70: 159-161 (2000) - [j19]Vladik Kreinovich, Luc Longpré:
How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. Bull. EATCS 71: 160-164 (2000) - 1999
- [j18]Misha Koshelev, Vladik Kreinovich, Luc Longpré:
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bull. EATCS 67: 153-156 (1999) - [j17]Luc Longpré, Vladik Kreinovich:
Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. Reliab. Comput. 5(2): 201-203 (1999) - [c12]Misha Koshelev, Vladik Kreinovich, Luc Longpré:
Encryption algorithms made natural. ITiCSE-WGR 1999: 50-51 - 1998
- [j16]Vladik Kreinovich, Luc Longpré:
Human Visual Perception and Kolmogorov Complexity: Revisited. Bull. EATCS 64 (1998) - [j15]Ann Q. Gates, Vladik Kreinovich, Luc Longpré:
Kolmogorov Complexity Justifies Software Engineering Heuristics. Bull. EATCS 66: 150-154 (1998) - [j14]Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré:
A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998) - 1996
- [j8]Luc Longpré, Vladik Kreinovich:
Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem. Bull. EATCS 59 (1996)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
