Sciweavers

880 search results - page 94 / 176
» The SLAM problem: a survey
Sort
View
SIGACT
2010
74views more  SIGACT 2010»
15 years 4 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
LPNMR
2011
Springer
14 years 9 months ago
Logic, Probability and Computation: Foundations and Issues of Statistical Relational AI
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...
David Poole
HICSS
2012
IEEE
268views Biometrics» more  HICSS 2012»
14 years 2 months ago
Goals and Tasks: Two Typologies of Citizen Science Projects
—Citizen science is a form of research collaboration involving members of the public in scientific research projects to address real-world problems. Often organized as a virtual...
Andrea Wiggins, Kevin Crowston
CAV
2009
Springer
165views Hardware» more  CAV 2009»
16 years 7 months ago
Symbolic Counter Abstraction for Concurrent Software
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
Daniel Kroening, Gérard Basler, Michele Maz...
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
16 years 1 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...