928 search results - page 17 / 186 » The degree structure of Weihrauch-reducibility |
104
click to vote
IJCV
2010
14 years 8 months ago
2010
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...
GRAPHICSINTERFACE
2009
14 years 8 months ago
2009
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
100
Voted
APPROX
2010
Springer
14 years 5 months ago
2010
Springer
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
JSYML
2008
14 years 10 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
JSYML
2006
14 years 10 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...