Sciweavers

3897 search results - page 264 / 780
» complexity 2010
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 1 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
INTERSPEECH
2010
15 years 1 months ago
Language model cross adaptation for LVCSR system combination
State-of-the-art large vocabulary continuous speech recognition (LVCSR) systems often combine outputs from multiple subsystems developed at different sites. Cross system adaptatio...
Xunying Liu, Mark J. F. Gales, Philip C. Woodland
SIAMJO
2010
136views more  SIAMJO 2010»
15 years 1 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ECOI
2007
80views more  ECOI 2007»
15 years 6 months ago
EcoLens: Integration and interactive visualization of ecological datasets
Complex multi-dimensional datasets are now pervasive in science and elsewhere in society. Better interactive tools are needed for visual data exploration so that patterns in such ...
Cynthia Sims Parr, Bongshin Lee, Benjamin B. Beder...
APAL
2010
115views more  APAL 2010»
15 years 6 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev