1390 search results - page 68 / 278 » Computing the depth of a flat |
COCO
2005
Springer
14 years 11 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
101
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: Residue depth allows determining how deeply a given residue is buried, in contrast to the solvent accessibility that differentiates between buried and solvent-exposed ...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
CGI
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a new fast algorithm for rendering the depthof-field effect for point-based surfaces. The algorithm handles partial occlusion correctly, it does not suffer from intens...