7930 search results - page 310 / 1586 » Greedy in Approximation Algorithms |
197
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
136
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
188
click to vote
IM
2007
15 years 6 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
150
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multicache systems are not well understood, especially in networks w...