Sciweavers

860 search results - page 21 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
CORR
2008
Springer
94views Education» more  CORR 2008»
13 years 6 months ago
Semi-continuous Sized Types and Termination
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
Andreas Abel
CCCG
2006
13 years 9 months ago
Small Weak Epsilon-Nets in Three Dimensions
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
Maryam Babazadeh, Hamid Zarrabi-Zadeh
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 8 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
CORR
2002
Springer
86views Education» more  CORR 2002»
13 years 7 months ago
Small Strictly Convex Quadrilateral Meshes of Point Sets
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...
FCT
2005
Springer
14 years 1 months ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski