2084 search results - page 125 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
131
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
139
click to vote
STOC
2005
ACM
16 years 5 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 ...
123
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
137
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
148
click to vote
JMLR
2006
15 years 4 months ago
2006
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...