Sciweavers

3341 search results - page 375 / 669
» On Bounded Queries and Approximation
Sort
View
QUESTA
2010
107views more  QUESTA 2010»
15 years 5 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
JMLR
2010
157views more  JMLR 2010»
15 years 1 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
COMPGEOM
2006
ACM
16 years 20 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
ALT
2009
Springer
16 years 3 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
PVLDB
2010
91views more  PVLDB 2010»
15 years 5 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...