Sciweavers

5153 search results - page 209 / 1031
» Introduction to Randomized Algorithms
Sort
View
RSA
2008
123views more  RSA 2008»
15 years 2 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
VTC
2010
IEEE
177views Communications» more  VTC 2010»
15 years 1 months ago
Randomized Robot-Assisted Relocation of Sensors for Coverage Repair in Wireless Sensor Networks
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...
159
Voted
RECOMB
2005
Springer
16 years 3 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...
ECCV
2008
Springer
16 years 1 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 7 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing