Sciweavers

941 search results - page 173 / 189
» Optimal Filters on the Sphere
Sort
View
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
CVPR
2008
IEEE
14 years 9 months ago
Object tracking and detection after occlusion via numerical hybrid local and global mode-seeking
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
Zhaozheng Yin, Robert T. Collins
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 9 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
SIGMOD
2010
ACM
189views Database» more  SIGMOD 2010»
14 years 15 days ago
Recsplorer: recommendation algorithms based on precedence mining
We study recommendations in applications where there are temporal patterns in the way items are consumed or watched. For example, a student who has taken the Advanced Algorithms c...
Aditya G. Parameswaran, Georgia Koutrika, Benjamin...