Sciweavers

1542 search results - page 14 / 309
» The metamathematics of random graphs
Sort
View
COMBINATORICS
2002
111views more  COMBINATORICS 2002»
13 years 9 months ago
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
Jair Donadelli, Yoshiharu Kohayakawa
EMNLP
2010
13 years 7 months ago
Word Sense Induction Disambiguation Using Hierarchical Random Graphs
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
Ioannis P. Klapaftis, Suresh Manandhar
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
ICIP
2010
IEEE
13 years 7 months 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
COMBINATORICA
2002
63views more  COMBINATORICA 2002»
13 years 9 months ago
Sparse Quasi-Random Graphs
Fan R. K. Chung, Ronald L. Graham