Sciweavers

1951 search results - page 306 / 391
» An algorithm for improving graph partitions
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 11 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 11 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
CGO
2003
IEEE
15 years 11 months ago
Code Optimization for Code Compression
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
Milenko Drinic, Darko Kirovski, Hoi Vo
MIR
2003
ACM
113views Multimedia» more  MIR 2003»
15 years 11 months ago
Semantic-meaningful content-based image retrieval in wavelet domain
In this paper, we propose a semantic-meaningful approach for region-based image retrieval in image database. Our retrieval system is based on wavelet transform for its decompositi...
Yongqing Sun, Shinji Ozawa
IPPS
2002
IEEE
15 years 11 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan