Sciweavers

10901 search results - page 410 / 2181
» Approximations in Distributed Optimization
Sort
View
ACL
2010
15 years 5 months ago
Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
Shay B. Cohen, Noah A. Smith
240
Voted
CORR
2011
Springer
152views Education» more  CORR 2011»
15 years 2 months ago
Sparsity Equivalence of Anisotropic Decompositions
Anisotropic decompositions using representation systems such as curvelets, contourlet, or shearlets have recently attracted significantly increased attention due to the fact that...
Gitta Kutyniok
CISS
2008
IEEE
16 years 2 months ago
Optimization via communication networks
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
Matthew Andrews
ICCSA
2005
Springer
16 years 1 months ago
Comparison of Global Optimization Methods for Drag Reduction in the Automotive Industry
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
Laurent Dumas, Vincent Herbert, Frédé...
ECRTS
2002
IEEE
16 years 16 days ago
Managing Multi-Mode Tasks with Time Cost and Quality Levels using Optimal Discrete Control Synthesis
Real-time control systems are complex to design, and automation support is important. We are interested in systems with multiple tasks, each with multiple modes, implementing a fu...
Hervé Marchand, Éric Rutten