20294 search results - page 3929 / 4059 » Algorithmic Information Theory |
211
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
252
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
233
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
360
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
166
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...