928 search results - page 159 / 186 » The degree structure of Weihrauch-reducibility |
ALENEX
2010
13 years 11 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
CARS
2003
13 years 11 months ago
2003
A new augmented reality apparatus was evaluated. The device uses scanned infrared and visible lasers to project computer generated information such as surgical plans, entry pints f...
AI
2007
Springer
13 years 10 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
BMCBI
2007
13 years 10 months ago
2007
Background: Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degr...
JCSS
2008
13 years 10 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...