Sciweavers

1728 search results - page 129 / 346
» The Accelerated Euclidean Algorithm
Sort
View
ICCV
2007
IEEE
16 years 5 months ago
DynamicBoost: Boosting Time Series Generated by Dynamical Systems
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
René Vidal, Paolo Favaro
119
Voted
ECCV
2000
Springer
16 years 5 months ago
Learning Similarity for Texture Image Retrieval
A novel algorithm is proposed to learn pattern similarities for texture image retrieval. Similar patterns in di erent texture classes are grouped into a cluster in the feature spac...
Guodong Guo, Stan Z. Li, Kap Luk Chan
IPMI
2005
Springer
16 years 3 months ago
Surface Matching via Currents
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in buildin...
Marc Vaillant, Joan Glaunes
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 3 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 3 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala