Results 1  10
of
18,203
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
Global Optimization with Polynomials and the Problem of Moments
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract

Cited by 577 (48 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
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
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 selfreconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results
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
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give
EntropyBased Algorithms For Best Basis Selection
 IEEE Transactions on Information Theory
, 1992
"... pretations (position, frequency, and scale), and we have experimented with featureextraction methods that use bestbasis compression for frontend complexity reduction. The method relies heavily on the remarkable orthogonality properties of the new libraries. It is obviously a nonlinear transformat ..."
Abstract

Cited by 675 (20 self)
 Add to MetaCart
, we can use information cost functionals defined for signals with normalized energy, since all expansions in a given library will conserve energy. Since two expansions will have the same energy globally, it is not necessary to normalize expansions to compare their costs. This feature greatly enlarges
Strictly Proper Scoring Rules, Prediction, and Estimation
, 2007
"... Scoring rules assess the quality of probabilistic forecasts, by assigning a numerical score based on the predictive distribution and on the event or value that materializes. A scoring rule is proper if the forecaster maximizes the expected score for an observation drawn from the distribution F if he ..."
Abstract

Cited by 373 (28 self)
 Add to MetaCart
attractive loss and utility functions that can be tailored to the problem at hand. This article reviews and develops the theory of proper scoring rules on general probability spaces, and proposes and discusses examples thereof. Proper scoring rules derive from convex functions and relate to information
Sparse signal reconstruction from limited data using FOCUSS: A reweighted minimum norm algorithm
 IEEE TRANS. SIGNAL PROCESSING
, 1997
"... We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algor ..."
Abstract

Cited by 368 (22 self)
 Add to MetaCart
We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS
Radiosity and Realistic Image Synthesis
, 1993
"... this paper, such as the global distribution of radiative energy in the tree crowns, which affects the amount of light reaching the leaves and the local temperature of plant organs. The presented framework itself is also open to further research. To begin, the precise functional specification of the ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
this paper, such as the global distribution of radiative energy in the tree crowns, which affects the amount of light reaching the leaves and the local temperature of plant organs. The presented framework itself is also open to further research. To begin, the precise functional specification
Exact optimization for markov random fields with convex priors
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2003
"... We introduce a method to solve exactly a first order Markov Random Field optimization problem in more generality than was previously possible. The MRF shall have a prior term that is convex in terms of a linearly ordered label set. The method maps the problem into a minimumcut problem for a direct ..."
Abstract

Cited by 216 (3 self)
 Add to MetaCart
directed graph, for which a globally optimal solution can be found in polynomial time. The convexity of the prior function in the energy is shown to be necessary and sufficient for the applicability of the method.
Some properties of Noether charge and a proposal for dynamical black hole entropy
 Phys. Rev
, 1994
"... We consider a general, classical theory of gravity with arbitrary matter fields in n dimensions, arising from a diffeomorphism invariant Lagrangian, L. We first show that L always can be written in a “manifestly covariant ” form. We then show that the symplectic potential current (n − 1)form, Θ, an ..."
Abstract

Cited by 326 (4 self)
 Add to MetaCart
, and the symplectic current (n − 1)form, ω, for the theory always can be globally defined in a covariant manner. Associated with any infinitesimal diffeomorphism is a Noether current (n − 1)form, J, and corresponding Noether charge (n − 2)form, Q. We derive a general “decomposition formula ” for Q. Using
Results 1  10
of
18,203