3055 search results - page 472 / 611 » Randomized Search Trees |
157
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
114
click to vote
CVPR
2010
IEEE
16 years 12 days ago
2010
IEEE
This paper addresses the problem of recognizing shadows from monochromatic natural images. Without chromatic information, shadow classification is very challenging because the in...
136
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
131
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
141
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...