Sciweavers

434 search results - page 57 / 87
» Monadic Bounded Algebras
Sort
View
MP
2006
134views more  MP 2006»
13 years 9 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 4 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
SIAMDM
2010
87views more  SIAMDM 2010»
13 years 4 months ago
On 3-Hypergraphs with Forbidden 4-Vertex Configurations
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
Alexander A. Razborov
LATIN
2010
Springer
14 years 4 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz