Sciweavers

2658 search results - page 257 / 532
» On efficient balanced codes
Sort
View
EDBT
2002
ACM
136views Database» more  EDBT 2002»
16 years 6 months ago
The Geometry of Uncertainty in Moving Objects Databases
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
Goce Trajcevski, Ouri Wolfson, Fengli Zhang, Sam C...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 5 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...
IJCNN
2006
IEEE
16 years 5 days ago
Particle Swarm Optimization based Defensive Islanding of Large Scale Power System
— Defensive islanding is an efficient way to avoid catastrophic failures and wide area blackouts. Power system splitting especially for large scale power systems is a combinatori...
Wenxin Liu, David A. Cartes, Ganesh K. Venayagamoo...
AUTONOMICS
2008
ACM
15 years 8 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
DEXA
2008
Springer
117views Database» more  DEXA 2008»
15 years 8 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...