Sciweavers

7129 search results - page 432 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
16 years 13 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
NETGAMES
2006
ACM
16 years 8 days ago
Comparing interest management algorithms for massively multiplayer games
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...
Jean-Sébastien Boulanger, Jörg Kienzle...
ECCV
2010
Springer
15 years 11 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
CDC
2009
IEEE
183views Control Systems» more  CDC 2009»
15 years 9 months ago
Algorithms and stability analysis for content distribution over multiple multicast trees
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
Xiaoying Zheng, Chunglae Cho, Ye Xia
ICST
2010
IEEE
15 years 4 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon