Sciweavers

162 search results - page 26 / 33
» Parallel frequent set counting
Sort
View
MICRO
1999
IEEE
109views Hardware» more  MICRO 1999»
13 years 12 months ago
Compiler-Directed Dynamic Computation Reuse: Rationale and Initial Results
Recent studies on value locality reveal that many instructions are frequently executed with a small variety of inputs. This paper proposes an approach that integrates architecture...
Daniel A. Connors, Wen-mei W. Hwu
FPL
2008
Springer
122views Hardware» more  FPL 2008»
13 years 9 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 8 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
BMCBI
2010
77views more  BMCBI 2010»
13 years 7 months ago
web cellHTS2: A web-application for the analysis of high-throughput screening data
Background: The analysis of high-throughput screening data sets is an expanding field in bioinformatics. Highthroughput screens by RNAi generate large primary data sets which need...
Oliver Pelz, Moritz Gilsdorf, Michael Boutros
TALG
2008
152views more  TALG 2008»
13 years 7 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...