1439 search results - page 9 / 288 » Fast approximation of centrality |
CPM
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
SSDBM
2005
IEEE
14 years 4 months ago
2005
IEEE
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
ICPR
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
SMA
2003
ACM
14 years 4 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...