Sciweavers

2324 search results - page 64 / 465
» A Fast Keyword-Spotting Technique
Sort
View
ASPDAC
2006
ACM
97views Hardware» more  ASPDAC 2006»
15 years 3 months ago
SASIMI: sparsity-aware simulation of interconnect-dominated circuits with non-linear devices
We present a technique for the fast and accurate simulation of largescale VLSI interconnects with nonlinear devices, called SASIMI. The numerical efficiency of this technique is ...
Jitesh Jain, Stephen Cauley, Cheng-Kok Koh, Venkat...
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
ICPR
2000
IEEE
15 years 11 months ago
Fast Pattern Recognition Using Gradient-Descent Search in an Image Pyramid
A new technique for fast pattern recognition using normalized grey-scale correlation (NGC) is described. While NGC has traditionally been slow due to computational intensity is
W. James MacLean, John K. Tsotsos
FP
1989
124views Formal Methods» more  FP 1989»
15 years 2 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
ICPR
2010
IEEE
15 years 5 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly