Sciweavers

15073 search results - page 309 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
BIOCOMP
2007
15 years 6 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
RAS
2002
247views more  RAS 2002»
15 years 4 months ago
Reference scan matching for global self-localization
Especially in dynamic environments a key feature concerning the robustness of mobile robot navigation is the capability of global self-localization. This term denotes a robot'...
Joachim Weber, Lutz Franken, Klaus-Werner Jör...
141
Voted
DAGM
2010
Springer
15 years 2 months ago
3D Reconstruction Using an n-Layer Heightmap
We present a novel method for 3D reconstruction of urban scenes extending a recently introduced heightmap model. Our model has several advantages for 3D modeling of urban scenes: i...
David Gallup, Marc Pollefeys, Jan-Michael Frahm
AI
2011
Springer
14 years 11 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
TIM
2010
144views Education» more  TIM 2010»
14 years 11 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta