Sciweavers

1541 search results - page 31 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li
ICML
2006
IEEE
14 years 10 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
TCS
2010
13 years 3 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
CAIP
2001
Springer
293views Image Analysis» more  CAIP 2001»
14 years 1 months ago
A Markov Random Field Image Segmentation Model Using Combined Color and Texture Features
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...
Zoltan Kato, Ting-Chuen Pong
ENTCS
2008
95views more  ENTCS 2008»
13 years 9 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...