Sciweavers

418 search results - page 17 / 84
» Circularity Measuring in Linear Time
Sort
View
RECOMB
2006
Springer
16 years 16 hour ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
SSS
2007
Springer
15 years 5 months ago
Stabilization of Flood Sequencing Protocols in Sensor Networks
Flood is a communication primitive that can be used by the base station of a sensor network to send a copy of a message to every sensor in the network. When a sensor receives a fl...
Young-ri Choi, Mohamed G. Gouda
COCOON
2001
Springer
15 years 4 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
INFOCOM
2010
IEEE
14 years 10 months ago
Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...
Elias Kehdi, Baochun Li
QSHINE
2009
IEEE
15 years 6 months ago
Cooperative Training in Wireless Sensor and Actor Networks
Exploiting features of high density wireless sensor networks represents a challenging issue. In this work, the training of a sensor network which consists of anonymous and asynchro...
Francesco Betti Sorbelli, Roberto Ciotti, Alfredo ...