Sciweavers

6315 search results - page 125 / 1263
» Approximating Solution Structure
Sort
View
CISS
2008
IEEE
16 years 26 days ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
16 years 6 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 10 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
TNN
2008
112views more  TNN 2008»
15 years 6 months ago
Multilayer Perceptrons: Approximation Order and Necessary Number of Hidden Units
Abstract--This paper considers the approximation of sufficiently smooth multivariable functions with a multilayer perceptron (MLP). For a given approximation order explicit formula...
S. Trenn
TEC
2008
115views more  TEC 2008»
15 years 6 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson