Sciweavers

8824 search results - page 83 / 1765
» On the Complexity of Real Functions
Sort
View
CIE
2009
Springer
15 years 10 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
ECCC
2007
90views more  ECCC 2007»
15 years 4 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
127
Voted
WSCG
2004
148views more  WSCG 2004»
15 years 5 months ago
Inverse Rendering of Polished Materials under Constant Complex Uncontrolled Illumination
Inverse rendering infers realistic descriptions of illumination and material properties from photographs. However, the applicability of state of the art inverse rendering algorith...
Michael Bang Nielsen, Anders Brodersen
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 10 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 11 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff