427 search results - page 80 / 86 » A Subexponential Bound for Linear Programming |
ESA
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
SIAMCOMP
1998
13 years 8 months ago
1998
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
JMLR
2011
13 years 3 months ago
2011
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...