Sciweavers

2750 search results - page 369 / 550
» Learning Efficient Parsing
Sort
View
115
Voted
AIIDE
2009
15 years 4 months ago
Supporting Dialogue Generation for Story-Based Games
Providing compelling, realistic, immersive game worlds is one of the major goals in modern game design. The presence of unique and interesting dialogue for all of the characters i...
Christopher Michael Kerr, Duane Szafron
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 4 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
IJON
2006
73views more  IJON 2006»
15 years 3 months ago
Optimal selection of time lags for TDSEP based on genetic algorithm
In this letter, a two-step learning scheme for the optimal selection of time lags is proposed for a typical temporal blind source separation (TBSS), Temporal Decorrelation source ...
Zhan-Li Sun, De-Shuang Huang, Chun-Hou Zheng, Li S...
IGPL
2007
107views more  IGPL 2007»
15 years 3 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
120
Voted
CORR
2002
Springer
180views Education» more  CORR 2002»
15 years 3 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer