Sciweavers

2780 search results - page 394 / 556
» Effective features of algorithm visualizations
Sort
View
91
Voted
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
15 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
ADBIS
2007
Springer
132views Database» more  ADBIS 2007»
15 years 4 months ago
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Rayner Alfred, Dimitar Kazakov
BROADNETS
2006
IEEE
15 years 4 months ago
A Statistical Approach to Anomaly Detection in Interdomain Routing
Abstract— A number of events such as hurricanes, earthquakes, power outages can cause large-scale failures in the Internet. These in turn cause anomalies in the interdomain routi...
Shivani Deshpande, Marina Thottan, Tin Kam Ho, Bip...
SIGIR
2004
ACM
15 years 3 months ago
Locality preserving indexing for document representation
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma
ML
2007
ACM
101views Machine Learning» more  ML 2007»
14 years 9 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre