2957 search results - page 201 / 592 » The Complexity of Polynomial-Time Approximation |
190
click to vote
ESA
1995
Springer
15 years 9 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
167
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
156
click to vote
ECCC
2010
15 years 6 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
160
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
179
click to vote
JMLR
2008
15 years 6 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...