Sciweavers

1414 search results - page 245 / 283
» Randomness and Universal Machines
Sort
View
FGR
2011
IEEE
209views Biometrics» more  FGR 2011»
13 years 1 months ago
Modeling hidden dynamics of multimodal cues for spontaneous agreement and disagreement recognition
— This paper attempts to recognize spontaneous agreement and disagreement based only on nonverbal multimodal cues. Related work has mainly used verbal and prosodic cues. We demon...
Konstantinos Bousmalis, Louis-Philippe Morency, Ma...
ICASSP
2011
IEEE
13 years 1 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
ICASSP
2011
IEEE
13 years 1 months ago
Time-frequency segmentation of bird song in noisy acoustic environments
Recent work in machine learning considers the problem of identifying bird species from an audio recording. Most methods require segmentation to isolate each syllable of bird call ...
Lawrence Neal, Forrest Briggs, Raviv Raich, Xiaoli...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
13 years 1 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...