Sciweavers

6315 search results - page 450 / 1263
» Approximating Solution Structure
Sort
View
INFOCOM
2012
IEEE
13 years 10 months ago
Cherish every joule: Maximizing throughput with an eye on network-wide energy consumption
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou
ICML
2005
IEEE
16 years 8 months ago
Near-optimal sensor placements in Gaussian processes
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
Carlos Guestrin, Andreas Krause, Ajit Paul Singh
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICASSP
2009
IEEE
16 years 2 months ago
A differential geometric approach to discrete-coefficient filter design
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
Subramanian Ramamoorthy, Lothar Wenzel, James Nagl...
LICS
2009
IEEE
16 years 2 months ago
Statistic Analysis for Probabilistic Processes
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
Michel de Rougemont, Mathieu Tracol