Sciweavers

6251 search results - page 238 / 1251
» Randomness, Computability, and Density
Sort
View
GECCO
2009
Springer
122views Optimization» more  GECCO 2009»
15 years 8 months ago
Visualising random boolean network dynamics
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
Susan Stepney
MEDIAFORENSICS
2010
15 years 6 months ago
Multimodal object authentication with random projections: a worst-case approach
In this paper, we consider a forensic multimodal authentication framework based on binary hypothesis testing in random projections domain. We formulate a generic authentication pr...
Oleksiy J. Koval, Sviatoslav Voloshynovskiy
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
15 years 5 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan

Source Code
1894views
15 years 11 months ago
Supervised Image Segmentation Using Markov Random Fields
This is the sample implementation of a Markov random field based image segmentation algorithm described in the following papers: 1. Mark Berthod, Zoltan Kato, Shan Yu, and Josi...
Csaba Gradwohl, Zoltan Kato
CVPR
2009
IEEE
15 years 11 months ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan