Sciweavers

5331 search results - page 200 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
111
Voted
MOC
2010
14 years 9 months ago
Entropy-satisfying relaxation method with large time-steps for Euler IBVPs
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...
Frédéric Coquel, Quang Long Nguyen, ...
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 9 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
88
Voted
CEC
2005
IEEE
15 years 8 months ago
Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
Siddhartha Shakya, John A. W. McCall, Deryck F. Br...
ICML
2005
IEEE
16 years 3 months ago
Online learning over graphs
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
Mark Herbster, Massimiliano Pontil, Lisa Wainer
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 2 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali