Sciweavers

13987 search results - page 458 / 2798
» The Two Guards Problem
Sort
View
FSTTCS
2010
Springer
15 years 5 months ago
Determining the Winner of a Dodgson Election is Hard
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
15 years 4 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
ICIP
2009
IEEE
15 years 4 months ago
Task-oriented camera assignment in a video network
Camera assignment and hand-off are some of the key image processing problems in a video network. In this paper, we propose a new approach for camera assignment and handoff in a vi...
Yiming Li, Bir Bhanu
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
15 years 1 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
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
15 years 1 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...