2434 search results - page 176 / 487 » Algorithmic Randomness of Closed Sets |
147
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We present a method for the simultaneous detection and segmentation of people from static images. The proposed technique requires no manual segmentation during training, and explo...
142
click to vote
RSA
2008
15 years 3 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
146
Voted
STOC
1992
ACM
15 years 8 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
117
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
121
Voted
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...