5183 search results - page 1036 / 1037 » The Complexity of Distributions |
STOC
2005
ACM
13 years 11 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
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 ...
DSD
2002
IEEE
13 years 10 months ago
2002
IEEE
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
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. ...