2434 search results - page 352 / 487 » Algorithmic Randomness of Closed Sets |
167
click to vote
PAMI
2011
14 years 10 months ago
2011
—Emerging applications of computer vision and pattern recognition in mobile devices and networked computing require the development of resourcelimited algorithms. Linear classifi...
150
Voted
TCBB
2011
14 years 10 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
154
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
129
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
127
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...