Sciweavers

320 search results - page 10 / 64
» Rigorous Result for the CHKNS Random Graph Model
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
PERCOM
2005
ACM
14 years 8 months ago
The Area Graph-Based Mobility Model and Its Impact on Data Dissemination
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
Sven Bittner, Wolf-Ulrich Raffel, Manuel Scholz
MICCAI
2005
Springer
14 years 9 months ago
Cross Entropy: A New Solver for Markov Random Field Modeling and Applications to Medical Image Segmentation
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
Jue Wu, Albert C. S. Chung
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
14 years 2 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...