Sciweavers

3740 search results - page 104 / 748
» A Fast Skeletonization Method
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 11 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
14 years 4 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
FIMH
2005
Springer
14 years 3 months ago
Fast Spatio-temporal Free-Form Registration of Cardiac MR Image Sequences
Abstract. In this paper we present a novel approach to the problem of spatiotemporal alignment of cardiac MR image sequences. This novel method has the ability to correct spatial m...
Dimitrios Perperidis, Raad Mohiaddin, Daniel Rueck...
JCNS
2010
90views more  JCNS 2010»
13 years 4 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
ICPR
2008
IEEE
14 years 11 months ago
Adaptive pore model for fingerprint pore extraction
Sweat pores have been recently employed for automated fingerprint recognition, in which the pores are usually extracted by using a computationally expensive skeletonization method...
Qijun Zhao, Lei Zhang, David Zhang, Nan Luo, Jing ...