Sciweavers

1666 search results - page 217 / 334
» Effective and efficient structured retrieval
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 10 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 10 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
IPPS
2006
IEEE
14 years 4 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
ICRA
2003
IEEE
134views Robotics» more  ICRA 2003»
14 years 3 months ago
Motion planning for a crowd of robots
- Moving a crowd of robots or avatars from their current configurations to some destination area without causing collisions is a challenging motion-planning problem because the hig...
Tsai-Yen Li, Hsu-Chi Chou
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 1 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...