3874 search results - page 89 / 775 » Approximation Algorithms for k-hurdle Problems |
ICANN
2007
Springer
15 years 4 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
100
click to vote
CIARP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
IAT
2006
IEEE
15 years 3 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
105
click to vote
ATAL
2008
Springer
14 years 12 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...