Sciweavers

335 search results - page 29 / 67
» On the approximation order of tangent estimators
Sort
View
NIPS
2007
15 years 3 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 8 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 5 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 2 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
MA
2010
Springer
132views Communications» more  MA 2010»
15 years 10 days ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki