12519 search results - page 282 / 2504 » Approximation Problems Categories |
190
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
245
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
162
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
152
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
196
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...