Sciweavers

3146 search results - page 30 / 630
» Efficient Consequence Finding
Sort
View
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 4 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
IEEEPACT
2005
IEEE
14 years 3 months ago
Exploiting Coarse-Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor
While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures sin...
Ben Wun, Jeremy Buhler, Patrick Crowley
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
14 years 2 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
ICCAD
2007
IEEE
234views Hardware» more  ICCAD 2007»
14 years 1 months ago
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon ...
HCI
2007
13 years 11 months ago
Getting Lost? Touch and You Will Find! The User-Centered Design Process of a Touch Screen
Recent reforms in office concepts have led to new intensification strategies that aim at more flexibility and efficiency. Hot desking is one of these new working practices that red...
Bieke Zaman, Rogier Vermaut