874 search results - page 21 / 175 » Faster Algorithms for Semi-Matching Problems |
142
click to vote
IJCAI
2001
15 years 7 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
146
click to vote
CCCG
2008
15 years 7 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
183
click to vote
ICPPW
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
132
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
136
click to vote
AAECC
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...