Sciweavers

1836 search results - page 256 / 368
» Mining Clustering Dimensions
Sort
View
110
Voted
ICPR
2006
IEEE
16 years 4 months ago
Geodesic Curves for Analysis of Continuous Implicit Shapes
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...
Jan Erik Solem
137
Voted
PARA
2004
Springer
15 years 9 months ago
Parallel Algorithms for Balanced Truncation Model Reduction of Sparse Systems
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
José M. Badía, Peter Benner, Rafael ...
151
Voted
KDD
2009
ACM
217views Data Mining» more  KDD 2009»
16 years 4 months ago
Efficient anomaly monitoring over moving object trajectory streams
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
Yingyi Bu, Lei Chen 0002, Ada Wai-Chee Fu, Dawei L...
140
Voted
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 4 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
140
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 9 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar