1390 search results - page 194 / 278 » Computing the depth of a flat |
SG
2009
Springer
15 years 4 months ago
2009
Springer
When we construct a model of origami (a model of a folded sheet of paper) in a computer, it is usual to represent the model as a set of polygons having zero thickness. One of the t...
ESCIENCE
2007
IEEE
15 years 4 months ago
2007
IEEE
: This paper describes the architecture and services developed by the GRANI project for the Australian Nanostructural Analysis Network Organization (NANO). The aim of GRANI was to ...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibrat...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...