Results 1  10
of
2,543
Convergent Treereweighted Message Passing for Energy Minimization
 ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI)
, 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] treereweighted maxproduct message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract

Cited by 489 (16 self)
 Add to MetaCart
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] treereweighted maxproduct message passing (TRW). It was inspired by the problem of maximizing a lower bound
Upper Bounds on the Lifetime of Sensor Networks
, 2001
"... In this paper, we ask a fundamental question concerning the limits of energy e#ciency of sensor networks  What is the upper bound on the lifetime of a sensor network that collects data from a specified region using a certain number of energyconstrained nodes? The answer to this question is valuabl ..."
Abstract

Cited by 198 (4 self)
 Add to MetaCart
In this paper, we ask a fundamental question concerning the limits of energy e#ciency of sensor networks  What is the upper bound on the lifetime of a sensor network that collects data from a specified region using a certain number of energyconstrained nodes? The answer to this question
A New Class of Upper Bounds on the Log Partition Function
 In Uncertainty in Artificial Intelligence
, 2002
"... Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis [11, 5, 4]. We introduce a new class of upper bounds on the log partition function, based on convex combinations of distribution ..."
Abstract

Cited by 225 (32 self)
 Add to MetaCart
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis [11, 5, 4]. We introduce a new class of upper bounds on the log partition function, based on convex combinations
Cache Decay: Exploiting Generational Behavior to Reduce Cache Leakage Power
 in Proceedings of the 28th International Symposium on Computer Architecture
, 2001
"... Power dissipation is increasingly important in CPUs ranging from those intended for mobile use, all the way up to highperformance processors for highend servers. While the bulk of the power dissipated is dynamic switching power, leakage power is also beginning to be a concern. Chipmakers expect tha ..."
Abstract

Cited by 280 (26 self)
 Add to MetaCart
. Because our decaybased techniques have notions of competitive online algorithms at their roots, their energy usage can be theoretically bounded at within a factor of two of the optimal oraclebased policy. We also examine adaptive decaybased policies that make energyminimizing policy choices on a per
Maintaining Stream Statistics over Sliding Windows (Extended Abstract)
, 2002
"... We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding window model. We consider the following basic problem: Given a stream of bits, maintain a count of the number of 1's i ..."
Abstract

Cited by 269 (9 self)
 Add to MetaCart
;s in the last N elements seen from the stream. We show that using O( 1 ffl log 2 N) bits of memory, we can estimate the number of 1's to within a factor of 1 + ffl. We also give a matching lower bound of \Omega\Gamma 1 ffl log 2 N) memory bits for any deterministic or randomized algorithms. We
Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments
, 2002
"... A key challenge in adhoc, datagathering wireless sensor networks is achieving a lifetime of several years using nodes that carry merely hundreds of joules of stored energy. In this paper, we explore the fundamental limits of energyefficient collaborative datagathering by deriving upper bounds on ..."
Abstract

Cited by 215 (0 self)
 Add to MetaCart
A key challenge in adhoc, datagathering wireless sensor networks is achieving a lifetime of several years using nodes that carry merely hundreds of joules of stored energy. In this paper, we explore the fundamental limits of energyefficient collaborative datagathering by deriving upper bounds
Enhancing compiler techniques for memory energy optimizations
 Embedded Software. Second International Conference, EMSOFT 2002, 2491:364 – 381
, 2002
"... Abstract. As both chip densities and clock frequencies steadily rise in modern microprocessors, energy consumption is quickly joining performance as a key design constraint. Power issues are increasingly important in embedded systems, especially those found in portable devices. Much research has foc ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
optimizations. Next, we present heuristic algorithms that determine a suitable optimization strategy given a memory energy upper bound. Finally, we demonstrate that our strategies will gain even more importance in the future when leakage energy is expected to play an even larger role in the total energy
The ContextTree Weighting Method: Basic Properties
 IEEE Trans. Inform. Theory
, 1995
"... We describe a sequential universal data compression procedure for binary tree sources that performs the "double mixture." Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desira ..."
Abstract

Cited by 230 (18 self)
 Add to MetaCart
We describe a sequential universal data compression procedure for binary tree sources that performs the "double mixture." Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a
Investigating upper bounds on network lifetime extension for cellbased energy conservation techniques in stationary ad hoc networks
 in Proceedings of the ACM/IEEE International COnference on Mobile Computing and Networking (MOBICOM
, 2002
"... Cooperative cellbased strategies have been recently proposed as a technique for extending the lifetime of wireless ad hoc networks, while only slightly impacting network performance. The effectiveness of this approach depends heavily on the node density: the higher it is, the more consistent energy ..."
Abstract

Cited by 139 (5 self)
 Add to MetaCart
energy savings can potentially be achieved. However, no general analyses of network lifetime have been done either for a base network (one without any energy conservation technique) or for one using cooperative energy conservation strategies. In this paper, we investigate the lifetime/density tradeoff
Some A Posteriori Error Estimators For Elliptic Partial Differential Equations
 MATHEMATICS OF COMPUTATION
, 1985
"... We present three new a posteriori error estimators in the energy norm for finite element solutions to elliptic partial differential equations. The estimators are based on solving local Neumann problems in each element. The estimators differ in how they enforce consistency of the Neumann problems. We ..."
Abstract

Cited by 215 (4 self)
 Add to MetaCart
. We prove that as the mesh size decreases, under suitable assumptions, two of the estimators approach upper bounds on the norm of the true error, and all three estimators are within multiplicative constants of the norm of the true error. We present numerical results in which one of the estimators
Results 1  10
of
2,543