215 search results - page 28 / 43 » Approximating Geometrical Graphs via |
347
click to vote
Lecture Notes
"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 ...
189
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—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...
149
Voted
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
193
Voted
ISAAC
2004
Springer
16 years 3 days ago
2004
Springer
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...
163
click to vote
FIMH
2009
Springer
16 years 1 months ago
2009
Springer
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...