Sciweavers

339 search results - page 17 / 68
» Geometry of Graphs
Sort
View
COMPGEOM
1995
ACM
13 years 11 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha
COCOA
2008
Springer
13 years 9 months ago
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...
ECCV
2010
Springer
14 years 1 months ago
Exploiting loops in the graph of trifocal tensors for calibrating a network of cameras
A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parame...
COMPGEOM
2011
ACM
12 years 11 months ago
Metric graph reconstruction from noisy data
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
Mridul Aanjaneya, Frédéric Chazal, D...
RSA
2011
102views more  RSA 2011»
13 years 2 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov