5595 search results - page 1098 / 1119 » Approximation Algorithms for Clustering Problems |
126
click to vote
SODA
2008
ACM
15 years 3 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...
103
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
136
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
105
click to vote
ECCC
2007
15 years 2 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
121
Voted
MP
2008
15 years 2 months ago
2008
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...