Sciweavers

629 search results - page 76 / 126
» The Generalized Quantum Database Search Algorithm
Sort
View
MSV
2004
13 years 10 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
GIS
2008
ACM
14 years 9 months ago
Continuous proximity monitoring in road networks
In this paper, we consider the following scenario: a set of mobile objects continuously track their positions in a road network and are able to communicate with a central server. ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
WWW
2008
ACM
14 years 9 months ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
SIGIR
2006
ACM
14 years 2 months ago
Near-duplicate detection by instance-level constrained clustering
For the task of near-duplicated document detection, both traditional fingerprinting techniques used in database community and bag-of-word comparison approaches used in information...
Hui Yang, James P. Callan
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...