5889 search results - page 834 / 1178 » Graph Layout Problems |
196
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
163
click to vote
ECCC
2006
15 years 6 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
239
click to vote
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
204
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Higher order energy functions have the ability to encode
high level structural dependencies between pixels, which
have been shown to be extremely powerful for image labeling
pro...