Sciweavers

873 search results - page 36 / 175
» Reducing the Frequent Pattern Set
Sort
View
ACTA
2006
104views more  ACTA 2006»
13 years 8 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
LCPC
2005
Springer
14 years 1 months ago
Dynamic Compilation for Reducing Energy Consumption of I/O-Intensive Applications
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir, A...
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 9 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
ICS
2003
Tsinghua U.
14 years 1 months ago
Inferential queueing and speculative push for reducing critical communication latencies
Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of Inferentially...
Ravi Rajwar, Alain Kägi, James R. Goodman
ICDAR
2003
IEEE
14 years 1 months ago
Accelerating Large Character Set Recognition using Pivots
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...
Yiping Yang, Ondrej Velek, Masaki Nakagawa