712 search results - page 77 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
155
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
190
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
146
click to vote
WISE
2006
Springer
15 years 9 months ago
2006
Springer
Filtering queries are widely used in data stream applications. As more and more filtering queries are registered in high-speed data stream management system, the processing efficie...
122
click to vote
TMC
2008
15 years 3 months ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
133
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...