4850 search results - page 322 / 970 » Approximate Data Structures with Applications |
169
click to vote
SEBD
2004
15 years 8 months ago
2004
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...
284
click to vote
VLDB
2009
ACM
16 years 7 months ago
2009
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
188
click to vote
NIPS
2008
15 years 8 months ago
2008
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
219
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
181
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
Performance profiling consists of monitoring a software system during execution and then analyzing the obtained data. There are two ways to collect profiling data: event tracing t...