Sciweavers

657 search results - page 8 / 132
» A Version Numbering Scheme with a Useful Lexicographical Ord...
Sort
View
MP
2008
101views more  MP 2008»
13 years 7 months ago
Accelerating the cubic regularization of Newton's method on convex problems
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...
Yu. Nesterov
LICS
2012
IEEE
11 years 9 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
Evolutionary Mesh Numbering: Preliminary Results
Abstract. Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This pa...
Francis Sourd, Marc Schoenauer
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
14 years 7 days ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
CSC
2006
13 years 8 months ago
Computing the Drift of Mutant Genes
- We develop a numerical scheme for computing the solution of a generalized version of Fisher's equation. The main idea is to use a modi ed Crank-Nicolson method in order to c...
Miguel Olmos-Gomez, Merced Arriaga-Gutierrez, Vali...