Sciweavers

497 search results - page 14 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
HEURISTICS
2008
120views more  HEURISTICS 2008»
14 years 9 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
COCOON
2005
Springer
15 years 3 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
14 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre