10608 search results - page 673 / 2122 » Complexity of O'Hara's Algorithm |
215
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We develop new algorithms for designing matched wavelets and matched scaling functions using a new parametrization of compactly supported orthonormal wavelets that is developed in...
249
Voted
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
353
Voted
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
200
Voted
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
222
Voted
CGF
2008
15 years 7 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...