Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
43,827
Natural Energy Bounds in Quantum Thermodynamics
, 2000
"... Given a stationary state for a noncommutative flow, we study a boundedness condition, depending on a parameter β> 0, which is weaker than the KMS equilibrium condition at inverse temperature β. This condition is equivalent to a holomorphic property closely related to the one recently considered b ..."
Abstract
-
Cited by 13 (4 self)
- Add to MetaCart
by Ruelle and D’Antoni-Zsido and shared by a natural class of non-equilibrium steady states. Our holomorphic property is stronger than the Ruelle’s one and thus selects a restricted class of non-equilibrium steady states. We also introduce the complete boundedness condition and show this notion
A scheduling model for reduced CPU energy
- ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract
-
Cited by 558 (3 self)
- Add to MetaCart
an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule. We then consider some on-line algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
Minimum energy mobile wireless networks
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract
-
Cited by 749 (0 self)
- Add to MetaCart
node guarantees strong connectivity of the entire network and attains the global minimum energy solution for stationary networks. Due to its localized nature, this protocol proves to be self-reconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results
Convergent Tree-reweighted 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]- tree-reweighted max-product 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]- tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
- IEEE TRANS. MOBILE COMPUTING
, 2004
"... Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed ..."
Abstract
-
Cited by 590 (1 self)
- Add to MetaCart
proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract
-
Cited by 788 (30 self)
- Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems
, 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract
-
Cited by 501 (4 self)
- Add to MetaCart
's real-time scheduler and task management service to provide significant energy savings while maintaining real-time deadline guarantees. We show through simulations and a working prototype implementation that these RT-DVS algorithms closely approach the theoretical lower bound on energy consumption
Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images.
- IEEE Trans. Pattern Anal. Mach. Intell.
, 1984
"... Abstract-We make an analogy between images and statistical mechanics systems. Pixel gray levels and the presence and orientation of edges are viewed as states of atoms or molecules in a lattice-like physical system. The assignment of an energy function in the physical system determines its Gibbs di ..."
Abstract
-
Cited by 5126 (1 self)
- Add to MetaCart
distribution. Because of the Gibbs distribution, Markov random field (MRF) equivalence, this assignment also determines an MRF image model. The energy function is a more convenient and natural mechanism for embodying picture attributes than are the local characteristics of the MRF. For a range of degradation
Elastically deformable models
- Computer Graphics
, 1987
"... The goal of visual modeling research is to develop mathematical models and associated algorithms for the analysis and synthesis of visual information. Image analysis and synthesis characterize the domains of computer vision and computer graphics, respectively. For nearly three decades, the vision an ..."
Abstract
-
Cited by 883 (20 self)
- Add to MetaCart
and graphics fields have been developing almost entirely independently—this despite the fact that, at least conceptually, the two disciplines are bound in a mutually converse relationship. Graphics, the direct problem, involves the synthesis of images from object models, whereas vision, the inverse problem
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
- Machine Learning
, 1988
"... learning Boolean functions, linear-threshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each ex ..."
Abstract
-
Cited by 773 (5 self)
- Add to MetaCart
example according to a current hypothesis. Then the learner updates the hypothesis, if necessary, based on the correct classification of the example. One natural measure of the quality of learning in this setting is the number of mistakes the learner makes. For suitable classes of functions, learning
Results 1 - 10
of
43,827
