Luc Longpré
Affiliations:- University of Texas at El Paso, USA
According to our database1,
Luc Longpré
authored at least 63 papers
between 1982 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.utep.edu
On csauthors.net:
Bibliography
2023
Fast - Asymptotically Optimal - Methods for Determining the Optimal Number of Features.
Proceedings of the Integrated Uncertainty in Knowledge Modelling and Decision Making, 2023
Proceedings of the Decision Making Under Uncertainty and Constraints - A Why-Book, 2023
Proceedings of the Decision Making Under Uncertainty and Constraints - A Why-Book, 2023
Proceedings of the Uncertainty, Constraints, and Decision Making, 2023
2019
Why the Best Predictive Models Are Often Different from the Best Explanatory Models: A Theoretical Explanation.
Proceedings of the Structural Changes and their Econometric Modeling, 2019
In Its Usual Formulation, Fuzzy Computation Is, In General, NP-Hard, But a More Realistic Formulation Can Make It Feasible.
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019
2017
Proceedings of the Recent Advances in Artificial Intelligence Research and Development, 2017
2015
Proceedings of the 2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC), 2015
2014
Proceedings of the Scientific Computing, Computer Arithmetic, and Validated Numerics, 2014
2013
Data anonymization that leads to the most accurate estimates of statistical characteristics: Fuzzy-motivated approach.
Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013
2011
Reliab. Comput., 2011
Int. J. Gen. Syst., 2011
Int. J. Approx. Reason., 2011
2010
Algorithmic information theory may explain the pathogenic number of DNA repeats in myotonic dystrophy type 1 (and in similar diseases).
SIGACT News, 2010
2009
2007
How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and Confidentiality.
Proceedings of the Computational Intelligence in Information Assurance and Security, 2007
2006
Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity.
Reliab. Comput., 2006
Measuring privacy loss in statistical databases.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006
2005
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures).
SIGACT News, 2005
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity.
Reliab. Comput., 2005
2004
Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications.
Reliab. Comput., 2004
Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals.
Reliab. Comput., 2004
Math. Log. Q., 2004
Proceedings of the Applied Parallel Computing, 2004
2003
Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact?
Reliab. Comput., 2003
Can quantum computers be useful when there are not yet enough qubits?
Bull. EATCS, 2003
Dirty pages of logarithm tables, lifetime of the universe, and subjective (fuzzy) probabilities on finite and infinite intervals.
Proceedings of the 12th IEEE International Conference on Fuzzy Systems, 2003
2002
Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation.
Bull. EATCS, 2002
2001
Inf. Process. Lett., 2001
Proceedings of the 2nd International Conference in Fuzzy Logic and Technology, 2001
2000
Choosing a Physical Model: Why Symmetries?
Bull. EATCS, 2000
How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation.
Bull. EATCS, 2000
1999
Proceedings of the Working Group Reports from ITiCSE on Innovation and Technology in Computer Science Education, 1999
Reliab. Comput., 1999
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark).
Bull. EATCS, 1999
1998
A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World.
Reliab. Comput., 1998
Human Visual Perception and Kolmogorov Complexity: Revisited.
Bull. EATCS, 1998
Kolmogorov Complexity Justifies Software Engineering Heuristics.
Bull. EATCS, 1998
1997
Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97).
Reliab. Comput., 1997
1996
Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem.
Bull. EATCS, 1996
1995
Inf. Comput., August, 1995
Proceedings of the STACS 95, 1995
1994
1993
1992
Nondeterministic and Alternating Computations.
Proceedings of the Computing and Information, 1992
1990
1988
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988
1986
Resource Bounded Kolmogorov Complexity, A Link between Computational Complexity & Information Theory.
PhD thesis, 1986
1982
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982