Sciweavers

3630 search results - page 224 / 726
» Fast Marching Methods
Sort
View
AI
2005
Springer
15 years 6 months ago
Fast Protein Superfamily Classification Using Principal Component Null Space Analysis
Abstract. The protein family classification problem, which consists of determining the family memberships of given unknown protein sequences, is very important for a biologist for ...
Leon French, Alioune Ngom, Luis Rueda
JCIT
2007
100views more  JCIT 2007»
15 years 6 months 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
CGF
2004
89views more  CGF 2004»
15 years 6 months 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 6 months 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...
DATAMINE
1999
113views more  DATAMINE 1999»
15 years 6 months 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