Sciweavers

14403 search results - page 48 / 2881
» Dynamical Systems Trees
Sort
View
JPDC
2002
104views more  JPDC 2002»
13 years 9 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
COMPSAC
2006
IEEE
14 years 1 months ago
Distributed Processes on Tree Hash
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
Kyosuke Yasuda, Takao Miura, Isamu Shioya
JEA
2008
112views more  JEA 2008»
13 years 10 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 10 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
EWSN
2006
Springer
14 years 9 months ago
Distributed Dynamic Shared Tree for Minimum Energy Data Aggregation of Multiple Mobile Sinks in Wireless Sensor Networks
Abstract. Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, thr...
Kwang-il Hwang, Jeongsik In, Doo Seop Eom