Sciweavers

1498 search results - page 86 / 300
» Collection tree protocol
Sort
View
CVPR
2001
IEEE
16 years 4 months ago
Mixtures of Trees for Object Recognition
Efficient detection of objects in images is complicated by variations of object appearance due to intra-class object differences, articulation, lighting, occlusions, and aspect va...
Sergey Ioffe, David A. Forsyth
INFOCOM
1999
IEEE
15 years 6 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
DCOSS
2006
Springer
15 years 6 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
IS
2011
14 years 9 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 2 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...