Sciweavers

3420 search results - page 116 / 684
» Proximity Search in Databases
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 1 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
MM
2004
ACM
99views Multimedia» more  MM 2004»
14 years 2 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 1 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
VC
2010
165views more  VC 2010»
13 years 7 months ago
Generating animation from natural language texts and semantic analysis for motion search and scheduling
This paper presents an animation system that generates an animation from natural language texts such as movie scripts or stories. It also proposes a framework for a motion database...
Masaki Oshita
PVLDB
2010
252views more  PVLDB 2010»
13 years 3 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu