Sciweavers

14548 search results - page 144 / 2910
» The Optimal Path-Matching Problem
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
PC
2010
196views Management» more  PC 2010»
13 years 8 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
CVPR
2012
IEEE
12 years 23 days ago
Discrete-continuous optimization for multi-target tracking
The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image obs...
Anton Andriyenko, Konrad Schindler, Stefan Roth
ICML
2009
IEEE
14 years 11 months ago
Interactively optimizing information retrieval systems as a dueling bandits problem
We present an on-line learning framework tailored towards real-time learning from observed user behavior in search engines and other information retrieval systems. In particular, ...
Yisong Yue, Thorsten Joachims