Sciweavers

1949 search results - page 163 / 390
» Random graphs on surfaces
Sort
View
CVIU
2007
152views more  CVIU 2007»
15 years 4 months ago
A random sampling strategy for piecewise planar scene segmentation
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...
Adrien Bartoli
IM
2007
15 years 4 months ago
Growing Protean Graphs
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
Pawel Pralat, Nicholas C. Wormald
EMNLP
2010
15 years 2 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
CVPR
2004
IEEE
16 years 6 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
JCT
2007
117views more  JCT 2007»
15 years 4 months ago
Large independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Joseph Lauer, Nicholas C. Wormald