919 search results - page 95 / 184 » Efficient computation of view subsets |
ICIP
2009
IEEE
13 years 7 months ago
2009
IEEE
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
CCGRID
2004
IEEE
14 years 1 months ago
2004
IEEE
Peer-to-peer environments have become popular as a framework for exchange of services. In these environments, certain peers may fail to provide their services. Reputation can be a...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
ICCV
2009
IEEE
13 years 7 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...