Sciweavers

6365 search results - page 414 / 1273
» Fast Local Computation Algorithms
Sort
View
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 8 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
ICDE
2000
IEEE
130views Database» more  ICDE 2000»
16 years 8 months ago
CMP: A Fast Decision Tree Classifier Using Multivariate Predictions
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
Haixun Wang, Carlo Zaniolo
DAC
2006
ACM
16 years 7 months ago
Fast analysis of structured power grid by triangularization based structure preserving model order reduction
In this paper, a Triangularization Based Structure preserving (TBS) model order reduction is proposed to verify power integrity of on-chip structured power grid. The power grid is...
Hao Yu, Yiyu Shi, Lei He
ISBI
2008
IEEE
16 years 7 months ago
Variational B-spline level-set method for fast image segmentation
In the field of image segmentation, most of level-set-based active contour approaches are based on a discrete representation of the associated implicit function. We present in thi...
Olivier Bernard, Denis Friboulet, Philippe Th&eacu...