234 search results - page 29 / 47 » On the relative complexity of approximate counting problems |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
116
click to vote
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
136
Voted
ESA
2000
Springer
15 years 5 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
102
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...