Sciweavers

1802 search results - page 288 / 361
» Complexity Theory for Operators in Analysis
Sort
View
TPDS
2010
94views more  TPDS 2010»
15 years 4 months ago
MIMO Power Control for High-Density Servers in an Enclosure
—Power control is becoming a key challenge for effectively operating a modern data center. In addition to reducing operating costs, precisely controlling power consumption is an ...
Xiaorui Wang, Ming Chen, Xing Fu
WWW
2009
ACM
16 years 7 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 6 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 6 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...