446 search results - page 25 / 90 » A fast algorithm for computing steiner edge connectivity |
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
SIGGRAPH
1998
ACM
15 years 1 months ago
1998
ACM
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
87
Voted
CGF
2004
14 years 9 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
DCC
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper proposes a partial prediction approach for fast mode decision in H.264/AVC 4x4 intra-prediction, exploiting the inherent symmetry existing in the spatial prediction mod...
98
Voted
JCP
2008
14 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...