Sciweavers

728 search results - page 129 / 146
» Efficient Searching with Linear Constraints
Sort
View
JMLR
2008
110views more  JMLR 2008»
14 years 11 months ago
Cross-Validation Optimization for Large Scale Structured Classification Kernel Methods
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
Matthias W. Seeger
PR
2006
102views more  PR 2006»
14 years 11 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
TKDE
2008
234views more  TKDE 2008»
14 years 11 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
4OR
2010
148views more  4OR 2010»
14 years 10 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ACCV
2010
Springer
14 years 6 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang