2310 search results - page 190 / 462 » Coloring Random Graphs |
116
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
152
click to vote
BMCBI
2011
14 years 9 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
127
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
TIP
2011
14 years 9 months ago
2011
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
115
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...