320 search results - page 57 / 64 » A New Compression Method with Fast Searching on Large Databa... |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
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...
DKE
1998
13 years 8 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
ADC
2008
Springer
14 years 2 months ago
2008
Springer
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
ICIP
2000
IEEE
14 years 25 days ago
2000
IEEE
The focus of this work is on using texture information for searching, browsing and retrieving images from a large database. In the wavelet approaches, texture is characterized by ...