Sciweavers

1891 search results - page 8 / 379
» Very Large Databases: How Large, How Different
Sort
View
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
13 years 10 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
IC
2003
13 years 10 months ago
Sampling Internet Topologies: How Small Can We Go?
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
Vaishnavi Krishnamurthy, Junhong Sun, Michalis Fal...
PVLDB
2008
110views more  PVLDB 2008»
13 years 8 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
DCC
2004
IEEE
14 years 8 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
DEXA
2004
Springer
70views Database» more  DEXA 2004»
14 years 1 months ago
How to Model Visual Knowledge: A Study of Expertise in Oil-Reservoir Evaluation
This work presents a study of the nature of expertise in geology, which demands visual recognition methods to describe and interpret petroleum reservoir rocks. In an experiment usi...
Mara Abel, Laura S. Mastella, Luís A. Lima ...