Sciweavers

2324 search results - page 61 / 465
» A Fast Keyword-Spotting Technique
Sort
View
FDG
2009
ACM
15 years 4 months ago
Very fast action selection for parameterized behaviors
In this paper, I will discuss a set of techniques for supporting limited variable binding in behavior-based systems. This adds additional useful expressivity while preserving the ...
Ian Horswill
GLOBECOM
2006
IEEE
15 years 4 months ago
Fast Stochastic Analysis of P2P File Distribution Architectures
— In this paper we investigate which is the most efficient architecture and protocol that can be used for file distribution. The focus of the analysis is to understand not only...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
IPPS
2003
IEEE
15 years 3 months ago
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
Andreas Krause, Markus Kräutner, Harald Meier
COLT
2001
Springer
15 years 2 months ago
Learning Additive Models Online with Fast Evaluating Kernels
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
Mark Herbster
ASPDAC
1999
ACM
101views Hardware» more  ASPDAC 1999»
15 years 2 months ago
Fast Boolean Matching Under Permutation Using Representative
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
Debatosh Debnath, Tsutomu Sasao