Sciweavers

20441 search results - page 526 / 4089
» Locally Computable Structures
Sort
View
ICPR
2000
IEEE
16 years 8 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
DCC
2008
IEEE
16 years 6 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
16 years 1 months ago
A General Framework for Local Pairwise Alignment Statistics with Gaps
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
Pasi Rastas
ICASSP
2008
IEEE
16 years 1 months ago
Factorized variational approximations for acoustic multi source localization
Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation ...
Volkan Cevher, Aswin C. Sankaranarayanan, Rama Che...
ICPR
2008
IEEE
16 years 1 months ago
3D localization of partially buried object in unstructured environment
This paper describes a method to localize objects which are partially buried in an unstructured environment. The objects are limited to surfaces of revolution in the present study...
Kenichi Maruyama, Koji Oka, Ryuichi Takase, Yoshih...