Sciweavers

28 search results - page 2 / 6
» Discrete Random Walks on One-Sided
Sort
View
CPC
2004
83views more  CPC 2004»
14 years 11 months ago
Embedding a Markov Chain into a Random Walk on a Permutation Group
Using representation theory, we obtain a necessary and sufficient condition for a discrete
Steven N. Evans
PAMI
2006
440views more  PAMI 2006»
14 years 11 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
VMV
2001
108views Visualization» more  VMV 2001»
15 years 25 days ago
A Theoretical Comparison of Monte Carlo Radiosity Algorithms
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
Philippe Bekaert, Hans-Peter Seidel
CORR
2004
Springer
104views Education» more  CORR 2004»
14 years 11 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 11 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....