33 search results - page 5 / 7 » Efficient Dilation, Erosion, Opening, and Closing Algorithms |
DIMACS
2001
13 years 10 months ago
2001
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
AFRIGRAPH
2003
ACM
14 years 6 days ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
JIIS
2010
13 years 3 months ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
AAAI
2000
13 years 10 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...