Sciweavers

43264 search results - page 8054 / 8653
» Comparing models of computation
Sort
View
SIGGRAPH
2010
ACM
15 years 8 months ago
Manifold bootstrapping for SVBRDF capture
Manifold bootstrapping is a new method for data-driven modeling of real-world, spatially-varying reflectance, based on the idea that reflectance over a given material sample forms...
Yue Dong, Jiaping Wang, Xin Tong, John Snyder, Yan...
GROUP
1993
ACM
15 years 8 months ago
ASCW: an assistant for cooperative work
The Assistant for Cooperative Work (ASCW) is a powerful system for the management of distributed work. It consists of the Task Manager, the organizational information system TOSCA...
Thomas Kreifelts, Wolfgang Prinz
COMPGEOM
1992
ACM
15 years 8 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
PPSN
1994
Springer
15 years 8 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
SPAA
1993
ACM
15 years 8 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
« Prev « First page 8054 / 8653 Last » Next »