13376 search results - page 256 / 2676 » Problem Solving with |
125
Voted
TCS
2008
15 years 3 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
118
Voted
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
In this paper we investigate, determine and classify the critical configurations for solving structure and motion problems for 1D retina vision. We give a complete categorization ...
108
Voted
BIRTHDAY
2004
Springer
15 years 9 months ago
2004
Springer
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...
111
Voted
SIAMNUM
2011
14 years 10 months ago
2011
We consider the methods xδ n+1 = xδ n − gαn (F (xδ n)∗F (xδ n))F (xδ n)∗(F (xδ n)− yδ) for solving nonlinear ill-posed inverse problems F (x) = y using the only ava...
146
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...