316 search results - page 32 / 64 » On Approximate Majority and Probabilistic Time |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
Our goal is to automatically identify which species of bird is present in an audio recording using supervised learning. Devising effective algorithms for bird species classificati...
115
click to vote
PODS
2011
ACM
14 years 14 days ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
82
Voted
IROS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Legged robots require accurate models of their environment in order to plan and execute paths. We present a probabilistic technique based on Gaussian processes that allows terr...
86
Voted
WACV
2008
IEEE
15 years 4 months ago
2008
IEEE
Most face recognition algorithms use a “distancebased” approach: gallery and probe images are projected into a low dimensional feature space and decisions about matching are b...