184 search results - page 18 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
106
click to vote
SIAMDM
2008
15 years 12 days ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
CORR
2010
Springer
15 years 17 days ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
100
Voted
DAM
1998
15 years 4 days ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
100
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
126
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...