Sciweavers

7106 search results - page 95 / 1422
» Restricted Complexity, General Complexity
Sort
View
COLT
2000
Springer
14 years 2 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
IBERAMIA
1998
Springer
14 years 2 months ago
Bayesian Networks for Reliability Analysis of Complex Systems
This paper presents an extension of Bayesian networks (BN) applied to reliability analysis. We developed a general methodology for modelling reliability of complex systems based o...
José G. Torres-Toledano, Luis Enrique Sucar
IMR
1998
Springer
14 years 2 months ago
Boundary Layer Meshing for Viscous Flows in Complex Domains
High reynolds number ow simulations exhibit strong gradients normal to walls and across shear layers requiring much ner resolution of the solution in some directions compared to o...
Rao V. Garimella, Mark S. Shephard
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 2 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 2 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka