Sciweavers

28 search results - page 2 / 6
» Compact Summaries over Large Datasets
Sort
View
VLDB
2001
ACM
138views Database» more  VLDB 2001»
13 years 9 months ago
A Data Warehousing Architecture for Enabling Service Provisioning Process
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
Yannis Kotidis
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 9 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
VLDB
1997
ACM
78views Database» more  VLDB 1997»
13 years 9 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
ICML
2010
IEEE
13 years 6 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
ECCV
2010
Springer
13 years 10 months ago
Building Compact Local Pairwise Codebook with Joint Feature Space Clustering
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...