140 search results - page 23 / 28 » Random projection algorithms for convex set intersection pro... |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
CPAIOR
2010
Springer
15 years 26 days ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
3DIM
2007
IEEE
15 years 1 months ago
2007
IEEE
An algorithm is presented to estimate the position of a hand-held camera with respect to a 3d world model constructed from range data and color imagery. Little prior knowledge is ...
SIAMJO
2010
14 years 4 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
114
click to vote
EMMCVPR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random elds composed of a set of homogeneous regions contours (bo...