Sciweavers

7930 search results - page 629 / 1586
» Greedy in Approximation Algorithms
Sort
View
COLING
2008
15 years 8 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
AAAI
2006
15 years 8 months ago
Representing Systems with Hidden State
We discuss the problem of finding a good state representation in stochastic systems with observations. We develop a duality theory that generalizes existing work in predictive sta...
Christopher Hundt, Prakash Panangaden, Joelle Pine...
ESANN
2004
15 years 8 months ago
Linearization identification and an application to BSS using a SOM
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
Fabian J. Theis, Elmar Wolfgang Lang
TPDS
2008
68views more  TPDS 2008»
15 years 7 months ago
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
Teofilo F. Gonzalez
SIAMJO
2008
81views more  SIAMJO 2008»
15 years 5 months ago
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
Andrea Walther