APPROX
2011
Springer
13 years 13 days ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
FOCS
2010
IEEE
13 years 10 months ago
2010
IEEE
We initiate the study of testing properties of images that correspond to sparse 0/1-valued matrices of size n
MOR
2010
13 years 11 months ago
2010
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
STOC
2005
ACM
15 years 22 days ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
STOC
2005
ACM
15 years 22 days ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
SPAA
2009
ACM
15 years 29 days ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...