Sciweavers

1421 search results - page 82 / 285
» Algorithms for subsequence combinatorics
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 5 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
DIS
2009
Springer
15 years 10 months ago
Contrasting Sequence Groups by Emerging Sequences
Abstract. Group comparison per se is a fundamental task in many scientific endeavours but is also the basis of any classifier. Contrast sets and emerging patterns contrast betwee...
Kang Deng, Osmar R. Zaïane
FPGA
2007
ACM
185views FPGA» more  FPGA 2007»
15 years 10 months ago
Power-aware FPGA logic synthesis using binary decision diagrams
Power consumption in field programmable gate arrays (FPGAs) has become an important issue as the FPGA market has grown to include mobile platforms. In this work we present a power...
Kevin Oo Tinmaung, David Howland, Russell Tessier
DAC
2010
ACM
15 years 7 months ago
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...
Thorsten Zitterell, Christoph Scholl
138
Voted
JUCS
2007
108views more  JUCS 2007»
15 years 4 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso