Sciweavers

3708 search results - page 703 / 742
» Approximating Betweenness Centrality
Sort
View
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 1 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
WABI
2001
Springer
110views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Boosting EM for Radiation Hybrid and Genetic Mapping
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating physical distances between them. It nicely complements...
Thomas Schiex, Patrick Chabrier, Martin Bouchez, D...
FOCS
2000
IEEE
14 years 1 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
ICNP
2000
IEEE
14 years 1 months ago
General AIMD Congestion Control
Instead of the increase-by-onedecrease-to-halfstrategy used in TCP Reno for congestion window adjustment, we consider the general case such that the increase value and decrease ra...
Yang Richard Yang, Simon S. Lam
INFOCOM
2000
IEEE
14 years 1 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste