2266 search results - page 30 / 454 » Some Solutions to the Ignoring Problem |
113
click to vote
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
108
click to vote
DISOPT
2006
15 years 1 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
CAISE
2005
Springer
15 years 6 months ago
2005
Springer
. This paper aims at proposing a global view of the interoperability problem, independently of any domain. We first describe explicitly the problem, and the context in which it app...
ENDM
2010
14 years 10 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
112
click to vote
AMC
2007
15 years 1 months ago
2007
In this paper, a boundary value problem for a nonlinear second-order ordinary differential equation is studied. By means of the maximum principle we established the existence and...