Sciweavers

3406 search results - page 415 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
PLDI
1995
ACM
15 years 10 months ago
Storage Assignment to Decrease Code Size
DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, ge...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Stev...
ICASSP
2011
IEEE
14 years 10 months ago
Proximal splitting methods for depth estimation
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
Mireille El Gheche, Jean-Christophe Pesquet, Jouma...
CORR
2011
Springer
206views Education» more  CORR 2011»
15 years 1 months ago
Convergence analysis of a proximal Gauss-Newton method
Abstract An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Co...
Saverio Salzo, Silvia Villa
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 10 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
KDD
2008
ACM
211views Data Mining» more  KDD 2008»
16 years 7 months ago
ArnetMiner: extraction and mining of academic social networks
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting ...
Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zha...