Sciweavers

1631 search results - page 44 / 327
» Uniform Distributed Synthesis
Sort
View
NIPS
2008
13 years 9 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
ISPAN
2005
IEEE
14 years 1 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
ICDE
2001
IEEE
111views Database» more  ICDE 2001»
14 years 9 months ago
Overcoming Limitations of Sampling for Aggregation Queries
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...
Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev...
ICCAD
1996
IEEE
76views Hardware» more  ICCAD 1996»
13 years 11 months ago
Directional bias and non-uniformity in FPGA global routing architectures
This paper investigates the effect of the prefabricated routing track distribution on the area-efficiency of FPGAs. The first question we address is whether horizontal and vertica...
Vaughn Betz, Jonathan Rose
FOCS
2000
IEEE
14 years 1 days ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan