Sciweavers

161 search results - page 32 / 33
» Methods for convex and general quadratic programming
Sort
View
SIAMNUM
2010
126views more  SIAMNUM 2010»
14 years 5 months ago
Smoothing under Diffeomorphic Constraints with Homeomorphic Splines
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in th...
Jérémie Bigot, Sébastien Gada...
NIPS
2007
15 years 14 days ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan
CORR
2007
Springer
130views Education» more  CORR 2007»
14 years 11 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
IPSN
2004
Springer
15 years 4 months ago
Distributed online localization in sensor networks using a moving target
We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, ...
Aram Galstyan, Bhaskar Krishnamachari, Kristina Le...
GLOBECOM
2008
IEEE
15 years 5 months ago
Delay-Energy Tradeoffs in Wireless Ad-Hoc Networks with Partial Channel State Information
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...
Matthew Brand, Andreas F. Molisch