11394 search results - page 197 / 2279 » Self-Organizing Data Structures |
151
click to vote
GFKL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
115
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
131
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
128
click to vote
EDM
2010
15 years 5 months ago
2010
Learning software is not designed for data analysis and mining. Because usage data is not stored in a systematic way, its thorough analysis requires long and tedious preprocessing....
141
click to vote
RTCSA
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper presents a method for tight prediction of worst-case performance of data caches in highperformance real-time systems. Our approach is to distinguish between data struct...