Sciweavers

CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 3 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 3 months ago
Algorithmic tests and randomness with respect to a class of measures
Laurent Bienvenu, Péter Gács, Mathie...
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
CORR
2011
Springer
213views Education» more  CORR 2011»
13 years 3 months ago
Adapting to Non-stationarity with Growing Expert Ensembles
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
Cosma Rohilla Shalizi, Abigail Z. Jacobs, Aaron Cl...
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 3 months ago
Exact maximum-likelihood method to detect patterns in real networks
Tiziano Squartini, Diego Garlaschelli
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Distributed Estimation and False Data Detection with Application to Power Networks
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
Fabio Pasqualetti, Ruggero Carli, Francesco Bullo
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 3 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 3 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
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 3 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad