6251 search results - page 416 / 1251 » Randomness, Computability, and Density |
153
click to vote
SPAA
2000
ACM
15 years 11 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
199
click to vote
RT
1998
Springer
15 years 11 months ago
1998
Springer
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
193
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
152
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we present a novel approach to contentsbased image retrieval. The method hinges in the use of quasi-random sampling to retrieve those images in a database which are...
143
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...