1717 search results - page 204 / 344 » A Computable Spectral Theorem |
179
click to vote
COCO
2009
Springer
16 years 17 days ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
155
click to vote
RTCSA
2007
IEEE
16 years 8 days ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
151
click to vote
CTRS
1990
15 years 10 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
163
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
147
click to vote
STACS
2007
Springer
16 years 3 days ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...