Sciweavers

995 search results - page 57 / 199
» complexity 2011
Sort
View
131
Voted
NETWORKS
2011
14 years 9 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
124
Voted
VLSISP
2011
241views Database» more  VLSISP 2011»
14 years 9 months ago
An Efficient VLSI Architecture of Fractional Motion Estimation in H.264 for HDTV
Abstract Fractional Motion Estimation (FME) in highdefinition H.264 presents a significant design challenge in terms of memory bandwidth, latency and area cost as there are various...
Gustavo A. Ruiz, Juan A. Michell
93
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Objective evaluation of the Dynamic Model Selection method for spectral voice conversion
Spectral voice conversion is usually performed using a single model selected in order to represent a tradeoff between goodness of fit and complexity. Recently, we proposed a new ...
Pierre Lanchantin, Xavier Rodet
139
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Bayesian reinforcement learning for POMDP-based dialogue systems
Spoken dialogue systems are gaining popularity with improvements in speech recognition technologies. Dialogue systems can be modeled effectively using POMDPs, achieving improvemen...
ShaoWei Png, Joelle Pineau
196
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie