Sciweavers

599 search results - page 37 / 120
» The repeater tree construction problem
Sort
View
127
Voted
CCCG
2003
15 years 5 months ago
Linear Binary Space Partitions and the Hierarchy of Object Classes
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
Petr Tobola, Karel Nechvíle
COMCOM
2006
120views more  COMCOM 2006»
15 years 4 months ago
Energy efficient routing and scheduling for real-time data aggregation in WSNs
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
Hongwei Du, Xiaodong Hu, Xiaohua Jia
ICPP
2005
IEEE
15 years 9 months ago
Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yama...
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 9 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
ACSC
2002
IEEE
15 years 9 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
Krisztián Monostori, Arkady B. Zaslavsky, H...