Sciweavers

108 search results - page 21 / 22
» Cover Trees for Nearest Neighbor
Sort
View
ICMCS
2010
IEEE
194views Multimedia» more  ICMCS 2010»
13 years 7 months ago
Speech emotion estimation in 3D space
Speech processing is an important aspect of affective computing. Most research in this direction has focused on classifying emotions into a small number of categories. However, nu...
Dongrui Wu, Thomas D. Parsons, Emily Mower, Shrika...
ICETET
2009
IEEE
13 years 4 months ago
Face Description with Local Invariant Features: Application to Face Recognition
A completely automatic face recognition system is presented. The method works on color face images and localizes the face region from them initially. It then determines and select...
Sanjay A. Pardeshi, S. N. Talbar
COMPGEOM
2003
ACM
14 years 8 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
ICPR
2008
IEEE
14 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
PVLDB
2011
12 years 9 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet