Sciweavers

116 search results - page 12 / 24
» A Quadratically Convergent Algorithm for Structured Low-Rank...
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 2 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
FOCM
2007
55views more  FOCM 2007»
14 years 10 months ago
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...
Marc Giusti, Grégoire Lecerf, Bruno Salvy, ...
UAI
1998
14 years 12 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
IROS
2007
IEEE
135views Robotics» more  IROS 2007»
15 years 4 months ago
Power-SLAM: A linear-complexity, consistent algorithm for SLAM
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
Esha D. Nerurkar, Stergios I. Roumeliotis
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 11 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...