6110 search results - page 408 / 1222 » Approximate Computing |
193
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
164
click to vote
DCG
2010
15 years 6 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
161
click to vote
CGF
2004
15 years 6 months ago
2004
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
122
click to vote
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
Abstract—The construction of world models typically requires laborious survey and cataloguing of a building’s contents. OpenRoomMap attempts to crowd-source this information by...
199
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
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...