Sciweavers

18306 search results - page 298 / 3662
» Algorithmics in Exponential Time
Sort
View
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
16 years 10 days ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
STOC
1999
ACM
81views Algorithms» more  STOC 1999»
15 years 11 months ago
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
AAECC
1993
Springer
94views Algorithms» more  AAECC 1993»
15 years 11 months ago
Relations Among Lie Formal Series and Construction of Symplectic Integrators
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
Pierre-Vincent Koseleff
UAI
2008
15 years 8 months ago
Estimation and clustering with infinite rankings
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Marina Meila, Le Bao
FOCM
2008
77views more  FOCM 2008»
15 years 6 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan