Sciweavers

244 search results - page 42 / 49
» A global optimization algorithm for protein surface alignmen...
Sort
View
SGP
2007
13 years 10 months ago
Dynamic geometry registration
We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a s...
Niloy J. Mitra, Simon Flöry, Maks Ovsjanikov,...
ECCV
2006
Springer
14 years 9 months ago
Oriented Visibility for Multiview Reconstruction
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
Victor S. Lempitsky, Yuri Boykov, Denis V. Ivanov
ICCV
1998
IEEE
13 years 12 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox
SBRN
2000
IEEE
13 years 12 months ago
Adaptation of Parameters of BP Algorithm Using Learning Automata
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...
Hamid Beigy, Mohammad Reza Meybodi
ALMOB
2006
155views more  ALMOB 2006»
13 years 7 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...