Sciweavers

548 search results - page 3 / 110
» Global value numbering using random interpretation
Sort
View
CVPR
2009
IEEE
15 years 1 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
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 ...
Dheeraj Singaraju, Leo Grady, René Vidal
CVPR
2011
IEEE
13 years 1 months ago
A Global Sampling Method for Alpha Matting
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
Kaiming He, Christoph Rhemann, Carsten Rother, Xia...
WSCG
2004
142views more  WSCG 2004»
13 years 7 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
FSE
1998
Springer
102views Cryptology» more  FSE 1998»
13 years 10 months ago
Cryptanalytic Attacks on Pseudorandom Number Generators
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
John Kelsey, Bruce Schneier, David Wagner, Chris H...
NIPS
2007
13 years 7 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens