497 search results - page 24 / 100 » Approximating max-min linear programs with local algorithms |
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
EMNLP
2010
14 years 7 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
101
click to vote
DISOPT
2008
14 years 9 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
ICAI
2007
14 years 11 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...