1391 search results - page 113 / 279 » Optimally Sparse Frames |
152
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
122
click to vote
SIGIR
2005
ACM
15 years 10 months ago
2005
ACM
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
128
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
151
click to vote
SAC
2010
ACM
15 years 2 months ago
2010
ACM
Problems involving high-dimensional data, such as pattern recognition, image analysis, and gene clustering, often require a preliminary step of dimension reduction before or durin...
150
click to vote
ICRA
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...