Sciweavers

2310 search results - page 136 / 462
» Coloring Random Graphs
Sort
View
ICIP
2010
IEEE
15 years 14 days ago
View synthesis based on Conditional Random Fields and graph cuts
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
Lam C. Tran, Christopher J. Pal, Truong Q. Nguyen
132
Voted
SPAA
2009
ACM
16 years 3 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
118
Voted
ICPR
2002
IEEE
16 years 3 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
16 years 2 months ago
Oblivious routing in directed graphs with random demands
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig...
88
Voted
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 2 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari