778 search results - page 103 / 156 » Bounding Smooth Integers |
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
JC
2007
13 years 7 months ago
2007
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...