Sciweavers

1222 search results - page 58 / 245
» Some Results on Directable Automata
Sort
View
MP
2006
134views more  MP 2006»
14 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
ACTA
1998
64views more  ACTA 1998»
14 years 9 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
ORL
2007
96views more  ORL 2007»
14 years 9 months ago
A note on scenario reduction for two-stage stochastic programs
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
Holger Heitsch, Werner Römisch
JSAC
2008
98views more  JSAC 2008»
14 years 9 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...