105 search results - page 12 / 21 » A Fast Algorithm for Moving Interface Problems |
106
click to vote
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
In this study, an algorithm is proposed to solve the multi-frame structure from motion (MFSfM) problem for monocular video sequences in dynamic scenes. The algorithm uses the epip...
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
ICCS
2005
Springer
2005
Springer
Towards a Bayesian Approach to Robust Finding Correspondences in Multiple View Geometry Environments
15 years 3 months ago
Abstract. This paper presents a new Bayesian approach to the problem of finding correspondences of moving objects in a multiple calibrated camera environment. Moving objects are d...
121
click to vote
TEC
2010
14 years 4 months ago
2010
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
ASPDAC
1999
ACM
15 years 1 months ago
1999
ACM
In this paper, we present a fast and efficient Iterative Improvement Partitioning (IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. Due to thei...