Results 1  10
of
39,448
Discretizing manifolds via minimum energy points
 NOTICES OF THE AMS
, 2004
"... There are a variety of needs for the discretization of a manifold—statistical sampling, quadrature rules, starting points for Newton’s method, computeraided design, interpolation schemes, finite element tessellations—to name but a few. So let us assume we are given a ddimensional manifold A in the ..."
Abstract

Cited by 67 (13 self)
 Add to MetaCart
There are a variety of needs for the discretization of a manifold—statistical sampling, quadrature rules, starting points for Newton’s method, computeraided design, interpolation schemes, finite element tessellations—to name but a few. So let us assume we are given a ddimensional manifold A
Distributed Minimum Energy Point Tracking for SystemsonChip
"... Abstract—We propose a new design approach for systemsonchip. The goal of the proposed design approach is to minimize the overall energy consumption dynamically, during runtime. The proposed approach builds on the well known globally asynchronous locally synchronous design style. To minimize power ..."
Abstract
 Add to MetaCart
noise and losses, we propose to use a single highvoltage global power delivery network. Locally integrated DCDC regulators generate a discrete range of supply voltage levels. These regulators are dynamically controlled by novel minimum energy point tracking (MEPT) controllers. The goal of the MEPT
MinimumEnergy Point Charge Configurations On A Circular Disk
, 1997
"... Stochastic global optimization methods are used to find configurations of n point charges on a circular disk such that the potential energy is minimized. Previously such optimal or conjecturally optimal configurations have been published for n <= 23 and n = 29; 30; 50. In this work configurations ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Stochastic global optimization methods are used to find configurations of n point charges on a circular disk such that the potential energy is minimized. Previously such optimal or conjecturally optimal configurations have been published for n <= 23 and n = 29; 30; 50. In this work
Minimum energy mobile wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer 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
We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
Fast and robust fixedpoint algorithms for independent component analysis
 IEEE TRANS. NEURAL NETW
, 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract

Cited by 884 (34 self)
 Add to MetaCart
, and estimation of individual independent components as projection pursuit directions. The statistical properties of the estimators based on such contrast functions are analyzed under the assumption of the linear mixture model, and it is shown how to choose contrast functions that are robust and/or of minimum
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 offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online 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
Fast approximate energy minimization via graph cuts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract

Cited by 2120 (61 self)
 Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when
Energyefficient communication protocol for wireless microsensor networks
, 2000
"... Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our f ..."
Abstract

Cited by 2103 (10 self)
 Add to MetaCart
findings that the conventional protocols of direct transmission, minimumtransmissionenergy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (LowEnergy Adaptive Clustering Hierarchy), a clusteringbased protocol that utilizes randomized rotation of local
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1315 (53 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1047 (23 self)
 Add to MetaCart
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions
Results 1  10
of
39,448