Sciweavers

87 search results - page 8 / 18
» Efficient Multidimensional Searching Routines
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 1 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
ICMCS
2006
IEEE
128views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Efficient Recognition of Authentic Dynamic Facial Expressions on the Feedtum Database
In order to allow for fast recognition of a user’s affective state we discuss innovative holistic and self organizing approaches for efficient facial expression analysis. The f...
Frank Wallhoff, Björn Schuller, Michael Hawel...
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 8 months ago
SoundCompass: A Practical Query-by-Humming System
This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techn...
Naoko Kosugi, Yasushi Sakurai, Masashi Morimoto
CN
2000
70views more  CN 2000»
13 years 7 months ago
An efficient algorithm to rank Web resources
How to rank Web resources is critical to Web Resource Discovery (Search Engine). This paper not only points out the weakness of current approaches, but also presents in-depth anal...
Dell Zhang, Yisheng Dong