Sciweavers

757 search results - page 91 / 152
» On the hardness of approximating Max-Satisfy
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Acoustic model training for non-audible murmur recognition using transformed normal speech data
In this paper we present a novel approach to acoustic model training for non-audible murmur (NAM) recognition using normal speech data transformed into NAM data. NAM is extremely ...
Denis Babani, Tomoki Toda, Hiroshi Saruwatari, Kiy...
CEC
2010
IEEE
14 years 1 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
INFOCOM
2011
IEEE
14 years 1 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
13 years 9 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
CVPR
2012
IEEE
13 years 7 days ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori