Sciweavers

3341 search results - page 164 / 669
» On Bounded Queries and Approximation
Sort
View
86
Voted
JC
2007
63views more  JC 2007»
14 years 10 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
Stephan Dahlke, Erich Novak, Winfried Sickel
113
Voted
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 2 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
68
Voted
ICPR
2004
IEEE
15 years 11 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
ICML
2008
IEEE
15 years 11 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
ICML
2006
IEEE
15 years 11 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan