Sciweavers

219 search results - page 35 / 44
» Drawing with Fat Edges
Sort
View
UAI
2008
13 years 9 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
MVA
1992
118views Computer Vision» more  MVA 1992»
13 years 8 months ago
A Mobile Robot for Visual Measurements in Architectural Applications
This paper describes a method to perform distance measurements inside buildings using a single video camera mounted on a mobile robot. This algorithm is designed specifically to c...
Xavier Lebègue, Jake K. Aggarwal
GD
2008
Springer
13 years 8 months ago
Crossing and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
Sergio Cabello, Bojan Mohar
COCOA
2010
Springer
13 years 5 months ago
Listing Triconnected Rooted Plane Graphs
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
Bingbing Zhuang, Hiroshi Nagamochi
ALGORITHMICA
2011
13 years 2 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
Sergio Cabello, Bojan Mohar