Sciweavers

1568 search results - page 236 / 314
» The problem of examination questions in algorithmics
Sort
View
FOCS
1998
IEEE
15 years 8 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
ICMCS
2007
IEEE
177views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Robust Analysis and Weighting on MFCC Components for Speech Recognition and Speaker Identification
Mismatch between training and testing data is a major error source for both Automatic Speech Recognition (ASR) and Automatic Speaker Identification (ASI). In this paper, we first ...
Xi Zhou, Yun Fu, Ming Liu, Mark Hasegawa-Johnson, ...
AUSDM
2006
Springer
94views Data Mining» more  AUSDM 2006»
15 years 8 months ago
Marking Time in Sequence Mining
Sequence mining is often conducted over static and temporal datasets as well as over collections of events (episodes). More recently, there has also been a focus on the mining of ...
Carl Mooney, John F. Roddick
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
15 years 7 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
EMNLP
2008
15 years 5 months ago
Acquiring Domain-Specific Dialog Information from Task-Oriented Human-Human Interaction through an Unsupervised Learning
We describe an approach for acquiring the domain-specific dialog knowledge required to configure a task-oriented dialog system that uses human-human interaction data. The key aspe...
Ananlada Chotimongkol, Alexander I. Rudnicky