Sciweavers

12519 search results - page 204 / 2504
» Approximation Problems Categories
Sort
View
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 6 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
16 years 19 days ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
SI3D
2006
ACM
16 years 13 days ago
Variance shadow maps
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
William Donnelly, Andrew Lauritzen
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
15 years 12 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang