Sciweavers

6095 search results - page 1034 / 1219
» Learning in Local Search
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Hill climbing on speech lattices: A new rescoring framework
We describe a new approach for rescoring speech lattices — with long-span language models or wide-context acoustic models — that does not entail computationally intensive latt...
Ariya Rastrow, Markus Dreyer, Abhinav Sethy, Sanje...
ICASSP
2011
IEEE
14 years 8 months ago
Horizontal small target detection with cooperative background estimation and removal filters
Detecting small targets is essential for mitigating the seabased Infrared search and track (IRST) problem. It is easy to detect small targets in homogeneous backgrounds such as th...
Sungho Kim, Yukyung Yang, Joo-Hyoung Lee
CEC
2010
IEEE
14 years 8 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...
JNCA
2011
102views more  JNCA 2011»
14 years 7 months ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...
PODC
2011
ACM
14 years 7 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
« Prev « First page 1034 / 1219 Last » Next »