1941 search results - page 143 / 389 » On the Hardness of Approximate Reasoning |
159
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
242
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
168
click to vote
STOC
2005
ACM
16 years 6 months 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 . ...
171
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
152
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...