Sciweavers

568 search results - page 100 / 114
» New bounds for the Cebysev functional
Sort
View
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
PAMI
2006
164views more  PAMI 2006»
13 years 7 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
JC
2006
86views more  JC 2006»
13 years 7 months ago
Randomly shifted lattice rules for unbounded integrands
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin ...
LICS
1991
IEEE
13 years 11 months ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss