Sciweavers

827 search results - page 119 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
ICRA
2008
IEEE
144views Robotics» more  ICRA 2008»
16 years 22 days ago
Interacting multiple model monocular SLAM
— Recent work has demonstrated the benefits of adopting a fully probabilistic SLAM approach in sequential motion and structure estimation from an image sequence. Unlike standard...
Javier Civera, Andrew J. Davison, J. M. M. Montiel
IPSN
2007
Springer
16 years 13 days ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...
FLOPS
2004
Springer
15 years 11 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 10 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
CIKM
2008
Springer
15 years 8 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand