Sciweavers

630 search results - page 60 / 126
» Hardness results for approximating the bandwidth
Sort
View
93
Voted
ANCS
2010
ACM
14 years 10 months ago
NetEx: efficient and cost-effective internet bulk content delivery
The Internet is witnessing explosive growth in traffic due to bulk content transfers, such as multimedia and software downloads, and online sharing of personal, commercial, and sc...
Massimiliano Marcon, Nuno Santos, P. Krishna Gumma...
114
Voted
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
16 years 22 days ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
ICML
2005
IEEE
16 years 1 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 7 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
115
Voted
P2P
2009
IEEE
137views Communications» more  P2P 2009»
15 years 7 months ago
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems
Abstract—Peer-to-peer storage systems aim to provide a reliable long-term storage at low cost. In such systems, peers fail continuously, hence, the necessity of self-repairing me...
Olivier Dalle, Frédéric Giroire, Jul...