6 search results - page 1 / 2 » The Intersection of Two Halfspaces Has High Threshold Degree |
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
STOC
2012
ACM
12 years 1 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
CSR
2007
Springer
14 years 5 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...