Sciweavers

2774 search results - page 314 / 555
» Exploiting Deep Structure
Sort
View
TRANSCI
2011
80views more  TRANSCI 2011»
15 years 1 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...
ICASSP
2010
IEEE
15 years 1 months ago
Unsupervised knowledge acquisition for Extracting Named Entities from speech
This paper presents a Named Entity Recognition (NER) method dedicated to process speech transcriptions. The main principle behind this method is to collect in an unsupervised way ...
Frédéric Béchet, Eric Charton
JAISE
2010
124views Algorithms» more  JAISE 2010»
15 years 1 months ago
Exploring the responsibilities of single-inhabitant Smart Homes with Use Cases
This paper makes a number of contributions to the field of requirements analysis for Smart Homes. It introduces Use Cases as a tool for exploring the responsibilities of Smart Home...
Paul Lyons, An Tran Cong, H. Joe Steinhauer, Steph...
JCNS
2010
103views more  JCNS 2010»
15 years 1 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
SIAMJO
2010
110views more  SIAMJO 2010»
15 years 1 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng