Sciweavers

478 search results - page 48 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Fingerprint matching based on distance metric learning
This paper considers a method for learning a distance metric in a fingerprinting system which identifies a query content by measuring the distance between the fingerprint of th...
Dalwon Jang, Chang D. Yoo
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
16 years 25 days ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
COMPGEOM
2006
ACM
16 years 23 days ago
Online geometric reconstruction
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
Bernard Chazelle, C. Seshadhri
ISIPTA
2003
IEEE
145views Mathematics» more  ISIPTA 2003»
16 years 1 days ago
An Extended Set-valued Kalman Filter
Set-valued estimation offers a way to account for imprecise knowledge of the prior distribution of a Bayesian statistical inference problem. The set-valued Kalman filter, which p...
Darryl Morrell, Wynn C. Stirling
COLT
2006
Springer
15 years 10 months ago
Ranking with a P-Norm Push
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
Cynthia Rudin