Sciweavers

215 search results - page 28 / 43
» Approximating Geometrical Graphs via
Sort
View

Lecture Notes
443views
15 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
INFOCOM
2007
IEEE
14 years 4 months ago
On Scalability of Proximity-Aware Peer-to-Peer Streaming
—P2P (peer-to-peer) technology has proved itself an efficient and cost-effective solution to support large-scale multimedia streaming. Different from traditional P2P application...
Liang Dai, Yi Cui, Yuan Xue
FOCS
2002
IEEE
14 years 2 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
FIMH
2009
Springer
14 years 4 months ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...