106 search results - page 12 / 22 » Edge clique graphs and some classes of chordal graphs |
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
FOCS
2005
IEEE
15 years 5 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...
103
click to vote
COMBINATORICA
2008
14 years 11 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
COMBINATORICA
2010
14 years 9 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
102
click to vote
ALT
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...