6393 search results - page 99 / 1279 » Randomized Algorithms on the Mesh |
151
Voted
STOC
1989
ACM
15 years 7 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
142
click to vote
MMSEC
2004
ACM
15 years 9 months ago
2004
ACM
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
123
Voted
DC
2000
15 years 3 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
135
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
122
click to vote
TCS
2010
15 years 1 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...