Sciweavers

3395 search results - page 274 / 679
» Learning to efficiently rank
Sort
View
ECCV
2008
Springer
16 years 8 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
ICDE
2003
IEEE
104views Database» more  ICDE 2003»
16 years 8 months ago
PIX: A System for Phrase Matching in XML Documents
We present a system that enables flexible and efficient phrase matching in XML documents. Since XML allows structured and unstructured information to be interleaved, phrase matchi...
Divesh Srivastava, Mary F. Fernández, Sihem...
ECIR
2006
Springer
15 years 8 months ago
An Information Retrieval System for Motion Capture Data
Motion capturing has become an important tool in fields such as sports sciences, biometrics, and particularly in computer animation, where large collections of motion material are ...
Bastian Demuth, Tido Röder, Meinard Müll...
CVPR
2008
IEEE
16 years 8 months ago
Structure learning in random fields for heart motion abnormality detection
Coronary Heart Disease can be diagnosed by assessing the regional motion of the heart walls in ultrasound images of the left ventricle. Even for experts, ultrasound images are dif...
Glenn Fung, Kevin Murphy, Mark Schmidt, Róm...
ICML
2009
IEEE
16 years 7 months ago
Semi-supervised learning using label mean
Semi-Supervised Support Vector Machines (S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances ...
Yu-Feng Li, James T. Kwok, Zhi-Hua Zhou