Sciweavers

3514 search results - page 524 / 703
» On Moving Object Queries
Sort
View
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
13 years 9 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
WWW
2004
ACM
16 years 7 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank
MIR
2005
ACM
137views Multimedia» more  MIR 2005»
16 years 2 days ago
Similarity space projection for web image search and annotation
Web image search has been explored and developed in academic as well as commercial areas for over a decade. To measure the similarity between Web images and user queries, most of ...
Ying Liu, Tao Qin, Tie-Yan Liu, Lei Zhang, Wei-Yin...
SRDS
1998
IEEE
15 years 10 months ago
A Data Allocation Algorithm for Distributed Hypermedia Documents
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
15 years 6 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...