Sciweavers

801 search results - page 95 / 161
» Minimal Locked Trees
Sort
View
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
15 years 11 months ago
Processing Event-Monitoring Queries in Sensor Networks
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Vassilis Stoumpos, Antonios Deligiannakis, Yannis ...
VLSID
2007
IEEE
126views VLSI» more  VLSID 2007»
15 years 10 months ago
An ECO Technique for Removing Crosstalk Violations in Clock Networks
Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix cros...
Amit Kumar, Krishnendu Chakrabarty, Chunduri Rama ...
RECOMB
2008
Springer
15 years 10 months ago
A Phylogenetic Approach to Genetic Map Refinement
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
Denis Bertrand, Mathieu Blanchette, Nadia El-Mabro...
EVOW
2009
Springer
15 years 4 months ago
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
Jean-Michel Richer, Adrien Goëffon, Jin-Kao H...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 4 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak