Sciweavers

1099 search results - page 119 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
MSN
2007
Springer
15 years 4 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
BMCBI
2008
132views more  BMCBI 2008»
14 years 10 months ago
The Average Mutual Information Profile as a Genomic Signature
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
Mark Bauer, Sheldon M. Schuster, Khalid Sayood
COCOON
1999
Springer
15 years 2 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 11 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
CGF
2004
97views more  CGF 2004»
14 years 9 months ago
Implicit Visualization and Inverse Modeling of Growing Trees
A method is proposed for photo-realistic modeling and visualization of a growing tree. Recent visualization methods have focused on producing smoothly blending branching structure...
Callum Galbraith, Lars Mündermann, Brian Wyvi...