Sciweavers

3049 search results - page 30 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
IJCAI
2003
13 years 9 months ago
Consistent, Convergent, and Constant-Time SLAM
This paper presents a new efficient algorithm for simultaneous localization and mapping (SLAM), using multiple overlapping submaps, each built with respect to a local frame of re...
John J. Leonard, Paul M. Newman
OPODIS
2004
13 years 9 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
ICANN
2005
Springer
14 years 1 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis