Sciweavers

3740 search results - page 244 / 748
» A Fast Skeletonization Method
Sort
View
107
Voted
JCIT
2007
100views more  JCIT 2007»
15 years 19 days ago
Frame Sliced Parallel Signature Files for Fast Colored Image Retrieval
The paper presents a novel approach for searching a very large image database employing frame sliced parallel signature file. Signature files have been proposed and used for retri...
Shashikala Tapaswi
67
Voted
CGF
2004
89views more  CGF 2004»
15 years 18 days ago
Fast Multipath Radiosity using Hierarchical Subscenes
This paper presents an efficient acceleration technique for the global line radiosity Multipath method. In this approach, the scene is subdivided in a hierarchy of box bounded sub...
Francesc Castro, Mateu Sbert, László...
DC
2002
15 years 17 days ago
Restoration by path concatenation: fast recovery of MPLS paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...
94
Voted
DATAMINE
1999
113views more  DATAMINE 1999»
15 years 12 days ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
93
Voted
TVCG
2010
141views more  TVCG 2010»
14 years 11 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar