Sciweavers

5169 search results - page 87 / 1034
» Locality approximation using time
Sort
View
116
Voted
BMCBI
2007
172views more  BMCBI 2007»
15 years 2 months ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
97
Voted
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 8 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
117
Voted
DEXA
2006
Springer
126views Database» more  DEXA 2006»
15 years 4 months ago
Hypersphere Indexer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
Navneet Panda, Edward Y. Chang, Arun Qamra
140
Voted
IPPS
2007
IEEE
15 years 8 months ago
Scalable, Distributed, Dynamic Resource Management for the ARMS Distributed Real-Time Embedded System
We present a scalable, hierarchical control system for the dynamic resource management of a distributed real-time embedded (DRE) system. This DRE is inspired by the DARPA Adaptive...
Kurt Rohloff, Yarom Gabay, Jianming Ye, Richard E....