Sciweavers

1632 search results - page 48 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
KDD
2012
ACM
254views Data Mining» more  KDD 2012»
13 years 5 months ago
Playlist prediction via metric embedding
Digital storage of personal music collections and cloud-based music services (e.g. Pandora, Spotify) have fundamentally changed how music is consumed. In particular, automatically...
Shuo Chen, Josh L. Moore, Douglas Turnbull, Thorst...
CVPR
2004
IEEE
16 years 5 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
15 years 1 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
ICCV
2005
IEEE
15 years 9 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov
NIPS
2007
15 years 4 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong