Sciweavers

6251 search results - page 852 / 1251
» Randomness, Computability, and Density
Sort
View
TSP
2008
103views more  TSP 2008»
15 years 7 months ago
Low-Rank Variance Approximation in GMRF Models: Single and Multiscale Approaches
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
Dmitry M. Malioutov, Jason K. Johnson, Myung Jin C...
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 7 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
ECCC
2000
93views more  ECCC 2000»
15 years 7 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
ENDM
2000
121views more  ENDM 2000»
15 years 7 months ago
Finding the chromatic number by means of critical graphs
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
Francine Herrmann, Alain Hertz
IJCV
2000
110views more  IJCV 2000»
15 years 7 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli