Sciweavers

15 search results - page 3 / 3
» Deducing Bounds on the Support of Itemsets
Sort
View
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 7 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
GLOBECOM
2007
IEEE
14 years 1 months ago
Opportunistic Feedback in OFDMA Downlink
—This paper presents an opportunistic feedback (OF) protocol that reduces the amount of channel-state-information (CSI) feedback for the OFDMA downlink system. The OF protocol as...
Rajiv Agarwal, Vineet Abhishek, Rath Vannithamby, ...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 6 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
BMCBI
2008
149views more  BMCBI 2008»
13 years 6 months ago
Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment s
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
Olivier Bastien, Eric Maréchal
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
13 years 6 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg