Sciweavers

1257 search results - page 229 / 252
» A generalization of Euler's constant
Sort
View
FOCS
2000
IEEE
14 years 12 hour ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
13 years 12 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
COMPGEOM
2000
ACM
13 years 12 months ago
A trace bound for the hereditary discrepancy
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
Bernard Chazelle, Alexey Lvov
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
13 years 12 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
SIGMOD
2000
ACM
104views Database» more  SIGMOD 2000»
13 years 12 months ago
Spatial Join Selectivity Using Power Laws
We discovered a surprising law governing the spatial join selectivity across two sets of points. An example of such a spatial join is "find the libraries that are within 10 m...
Christos Faloutsos, Bernhard Seeger, Agma J. M. Tr...