2780 search results - page 394 / 556 » Effective features of algorithm visualizations |
185
Voted
STOC
2001
ACM
16 years 6 months ago
2001
ACM
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...
177
click to vote
ADBIS
2007
Springer
2007
Springer
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
16 years 8 days ago
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...
182
click to vote
BROADNETS
2006
IEEE
16 years 4 days ago
2006
IEEE
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...
186
click to vote
SIGIR
2004
ACM
15 years 11 months ago
2004
ACM
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
142
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
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...