7930 search results - page 560 / 1586 » Greedy in Approximation Algorithms |
157
click to vote
CC
2007
Springer
16 years 1 months ago
2007
Springer
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
197
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
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...
186
click to vote
NETGAMES
2006
ACM
16 years 1 months ago
2006
ACM
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
216
Voted
ECCV
2010
Springer
16 years 8 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
198
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...