Sciweavers

9842 search results - page 437 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
15 years 2 months ago
An integrated probabilistic model for scan-matching, moving object detection and motion estimation
Abstract-- This paper presents a novel framework for integrating fundamental tasks in robotic navigation through a statistical inference procedure. A probabilistic model that joint...
Joop van de Ven, Fabio Ramos, Gian Diego Tipaldi
WISTP
2010
Springer
15 years 2 months ago
Efficient Mutual Authentication for Multi-domain RFID Systems Using Distributed Signatures
Abstract. The use of RFID technology in complex and distributed environments often leads to a multi-domain RFID system in which security issues such as authentication of tags and r...
Michael Braun, Ulrike Meyer, Susanne Wetzel
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 1 months ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 11 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 11 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy