61 search results - page 7 / 13 » Computational Indistinguishability: A Sample Hierarchy |
PPSN
2004
Springer
14 years 23 days ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
PVLDB
2010
13 years 5 months ago
2010
This paper describes a high performance sampling architecture for inference of latent topic models on a cluster of workstations. Our system is faster than previous work by over an...
PG
2002
IEEE
14 years 10 days ago
2002
IEEE
We present the light field oracle, a novel mathematical concept for the acquisition, processing and representation of light fields. We first compute a hierarchical representati...
VISUALIZATION
2002
IEEE
14 years 9 days ago
2002
IEEE
A long-standing research problem in computer graphics is to reproduce the visual experience of walking through a large photorealistic environment interactively. On one hand, tradi...
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...