Sciweavers

391 search results - page 38 / 79
» Constructive Equivalence Relations on Computable Probability...
Sort
View
MLQ
2007
91views more  MLQ 2007»
14 years 11 months ago
Almost everywhere domination and superhighness
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
Stephen G. Simpson
FOCS
2004
IEEE
15 years 3 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
15 years 6 months ago
A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
Stephen Tully, George Kantor, Howie Choset, Felix ...
ICPR
2000
IEEE
15 years 3 months ago
Maximum Likelihood Stereo Matching
In the research literature, maximum likelihood principles were applied to stereo matching by altering the stereo pair so that the difference would have a Gaussian distribution. He...
Nicu Sebe, Michael S. Lew
STACS
2009
Springer
15 years 6 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson