14518 search results - page 421 / 2904 » Two Problems for Sophistication |
162
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is f...
193
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
160
click to vote
ISAAC
2005
Springer
16 years 11 days ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
170
click to vote
JSAT
2007
15 years 6 months ago
2007
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
162
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
We study the compression problem of visual scenes acquired with a camera for transmission or storage. Our proposed model is general and includes two well-known cases: that of vide...