Sciweavers

503 search results - page 29 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ESANN
2006
14 years 11 months ago
Discriminacy of the minimum range approach to blind separation of bounded sources
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...
Dinh-Tuan Pham, Frédéric Vrins
ECCC
2011
187views ECommerce» more  ECCC 2011»
14 years 1 months ago
In Brute-Force Search of Correlation Bounds for Polynomials
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Frederic Green, Daniel Kreymer, Emanuele Viola
MICCAI
2010
Springer
14 years 7 months ago
Symmetric Positive-Definite Cartesian Tensor Orientation Distribution Functions (CT-ODF)
Abstract. A novel method for estimating a field of orientation distribution functions (ODF) from a given set of DW-MR images is presented. We model the ODF by Cartesian tensor basi...
Yonas T. Weldeselassie, Angelos Barmpoutis, M. Ste...
TIT
2008
111views more  TIT 2008»
14 years 9 months ago
The Bounded-Storage Model in the Presence of a Quantum Adversary
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y , the output (X; Y ) is close to uniform. We study properties...
Robert T. König, Barbara M. Terhal