Sciweavers

727 search results - page 83 / 146
» Private approximation of search problems
Sort
View
MT
2010
96views more  MT 2010»
13 years 8 months ago
Monte Carlo techniques for phrase-based translation
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
13 years 11 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya
JORS
2011
67views more  JORS 2011»
13 years 5 months ago
Robust parameter design optimization of simulation experiments using stochastic perturbation methods
Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simula...
A. K. Miranda, E. Del Castillo
SIGIR
2009
ACM
14 years 4 months ago
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
Jimmy J. Lin
FOCS
2007
IEEE
14 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis