Sciweavers

3208 search results - page 144 / 642
» A Lower Bound for Primality
Sort
View
CLASSIFICATION
2008
71views more  CLASSIFICATION 2008»
15 years 6 months ago
Bounds of Resemblance Measures for Binary (Presence/Absence) Variables
Abstract: Bounds of association coefficients for binary variables are derived using the arithmetic-geometric-harmonic mean inequality. More precisely, it is shown which presence/ab...
Matthijs J. Warrens
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
16 years 1 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
CORR
2010
Springer
179views Education» more  CORR 2010»
15 years 3 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
COLT
2008
Springer
15 years 8 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
15 years 6 months ago
Bound Graph Polysemy
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
Paul J. Tanenbaum