Sciweavers

318 search results - page 14 / 64
» Decomposition of Domains
Sort
View
EACL
2006
ACL Anthology
14 years 11 months ago
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs pres...
Genevieve Gorrell
ACSC
2009
IEEE
15 years 5 months ago
HOPPER: a hierarchical planning agent for unpredictable domains
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited t...
Maciej Wojnar, Peter Andreae
CP
2009
Springer
15 years 5 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
84
Voted
RE
2004
Springer
15 years 3 months ago
Architecture-driven Problem Decomposition
Jackson’s Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domai...
Lucia Rapanotti, Jon G. Hall, Michael Jackson, Bas...
82
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Time domain reconstruction of spatial sound fields using compressed sensing
A novel technique for time domain spatial sound reproduction using compressed sensing is presented. The presented technique is based on the application of compressed sensing theor...
Andrew Wabnitz, Nicolas Epain, André van Sc...