Sciweavers

1261 search results - page 94 / 253
» Approximation algorithms for aligning points
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
AMFG
2003
IEEE
244views Biometrics» more  AMFG 2003»
15 years 3 months ago
Manifold of Facial Expression
In this paper, we propose the concept of Manifold of Facial Expression based on the observation that images of a subject’s facial expressions define a smooth manifold in the hig...
Ya Chang, Changbo Hu, Matthew Turk
JDA
2008
87views more  JDA 2008»
14 years 9 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 2 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICML
2004
IEEE
15 years 10 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...