154 search results - page 28 / 31 » Algorithms for Implicit Hitting Set Problems |
CCCG
2003
13 years 9 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
PODS
2002
ACM
14 years 7 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
NETWORKS
2011
12 years 10 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
VIS
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...