1208 search results - page 150 / 242 » Uniform eventown problems |
159
Voted
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
DAC
1999
ACM
15 years 10 months ago
1999
ACM
We propose a new VLSI layout methodology which addresses the main problems faced in Deep Sub-Micron (DSM) integrated circuit design. Our layout "fabric" scheme eliminate...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
To bridge the increasing processor-disk performance gap, buffer caches are used in both storage clients (e.g. database systems) and storage servers to reduce the number of slow di...