928 search results - page 126 / 186 » The degree structure of Weihrauch-reducibility |
150
click to vote
ECCC
2007
15 years 6 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
152
click to vote
BMCBI
2010
15 years 6 months ago
2010
nd: Although methods based on highly abstract descriptions of protein structures, such as VAST and TOPS, can perform very fast protein structure comparison, the results can lack a...
199
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
146
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Router-level maps of the Internet implicate a large body of research on network management, overlay networks, performance evaluation, and security. The inaccuracies in these maps r...
158
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...