1677 search results - page 212 / 336 » On the Completeness of Quantum Computation Models |
139
click to vote
KCAP
2005
ACM
16 years 54 min ago
2005
ACM
Among the variety of alignment approaches (e.g., using machine learning, subsumption computation, formal concept analysis, etc.) similarity-based ones rely on a quantitative asses...
157
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
179
click to vote
DICTA
2003
15 years 7 months ago
2003
In this paper, we present a new approach for hand-written character and digit recognitions based on shape descriptor and the Hausdorff Context. We start at finding the correspondi...
167
click to vote
IWFM
1998
15 years 7 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
161
click to vote
IPPS
2006
IEEE
16 years 14 days ago
2006
IEEE
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...