4926 search results - page 66 / 986 » Two Graph Algorithms On an Associative Computing Model |
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
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...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
ICDE
1998
IEEE
14 years 9 months ago
1998
IEEE
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects....
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...