Sciweavers

1390 search results - page 203 / 278
» Computing the depth of a flat
Sort
View
FCT
2005
Springer
15 years 3 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 3 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
IWINAC
2005
Springer
15 years 3 months ago
Model Performance for Visual Attention in Real 3D Color Scenes
Abstract. Visual attention is the ability of a vision system, be it biological or artificial, to rapidly detect potentially relevant parts of a visual scene. The saliency-based mo...
Heinz Hügli, Timothée Jost, Nabil Ouer...
APGV
2004
ACM
131views Visualization» more  APGV 2004»
15 years 3 months ago
Vision-realistic rendering: simulation of the scanned foveal image from wavefront data of human subjects
We introduce the concept of vision-realistic rendering – the computer generation of synthetic images that incorporate the characteristics of a particular individual’s entire o...
Brian A. Barsky
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
15 years 3 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola