Sciweavers

4110 search results - page 54 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ACL
2009
15 years 1 months ago
Phrase-Based Statistical Machine Translation as a Traveling Salesman Problem
An efficient decoding algorithm is a crucial element of any statistical machine translation system. Some researchers have noted certain similarities between SMT decoding and the f...
Mikhail Zaslavskiy, Marc Dymetman, Nicola Cancedda
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 3 months ago
Interior-Point Algorithms for Linear-Programming Decoding
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
Pascal O. Vontobel
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
15 years 5 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
Guoqiang Bai 0002, Henning Fernau
156
Voted
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 1 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 7 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule