Sciweavers

762 search results - page 43 / 153
» Finding Facilities Fast
Sort
View
ISCA
1999
IEEE
88views Hardware» more  ISCA 1999»
15 years 8 months ago
A Scalable Front-End Architecture for Fast Instruction Delivery
In the pursuit of instruction-level parallelism, significant demands are placed on a processor's instruction delivery mechanism. Delivering the performance necessary to meet ...
Glenn Reinman, Todd M. Austin, Brad Calder
153
Voted
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 8 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 7 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
15 years 7 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
DAC
2005
ACM
15 years 5 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi