Sciweavers

903 search results - page 166 / 181
» On the reduction of a random basis
Sort
View
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
15 years 11 months ago
Profile-Driven Cache Management
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
Mitch Cherniack, Eduardo F. Galvez, Michael J. Fra...
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
15 years 10 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
15 years 10 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 10 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 7 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...