341 search results - page 65 / 69 » Quantum Computation and Lattice Problems |
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
SC
1995
ACM
13 years 11 months ago
1995
ACM
Rapid increases in computing and communication performance are exacerbating the long-standing problem of performance-limited input/output. Indeed, for many otherwise scalable para...
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
Contrary to popular belief, despite decades of research in fingerprints, reliable fingerprint recognition is an open problem. Extracting features out of poor quality prints is t...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...