1450 search results - page 290 / 290 » On the Complexity of Hardness Amplification |
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
ANCS
2008
ACM
13 years 7 months ago
2008
ACM
We describe the implementation of an OpenFlow Switch on the NetFPGA platform. OpenFlow is a way to deploy experimental or new protocols in networks that carry production traffic. ...
BMCBI
2007
13 years 5 months ago
2007
Background: Neuroscientists often need to access a wide range of data sets distributed over the Internet. These data sets, however, are typically neither integrated nor interopera...
ANCS
2009
ACM
13 years 3 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...