Sciweavers

613 search results - page 93 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
DAM
2010
112views more  DAM 2010»
14 years 10 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
ICIP
2002
IEEE
15 years 11 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
INFOCOM
2005
IEEE
15 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
SSDBM
2005
IEEE
122views Database» more  SSDBM 2005»
15 years 3 months ago
Detection and Tracking of Discrete Phenomena in Sensor-Network Databases
This paper introduces a framework for Phenomena Detection and Tracking (PDT, for short) in sensor network databases. Examples of detectable phenomena include the propagation over ...
Mohamed H. Ali, Mohamed F. Mokbel, Walid G. Aref, ...