Sciweavers

6251 search results - page 48 / 1251
» Randomness, Computability, and Density
Sort
View
CVPR
1999
IEEE
14 years 10 months ago
Implicit Representation and Scene Reconstruction from Probability Density Functions
A technique is presented for representing linear features as probability density functions in two or three dimensions. Three chief advantages of this approach are (1) a unified re...
Steven M. Seitz, P. Anandan
AHS
2007
IEEE
263views Hardware» more  AHS 2007»
14 years 3 months ago
Programming an FPGA-based Super Computer Using a C-to-VHDL Compiler: DIME-C
Since their invention in the 1980s, the logic density of FPGAs has increased exponentially with time. This increase of logic density first led to the development of synthesisable ...
Gildas Genest, Richard Chamberlain, Robin J. Bruce
FOCS
2009
IEEE
14 years 3 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer