120 search results - page 14 / 24 » FPT Algorithms for Connected Feedback Vertex Set |
131
Voted
NIPS
1997
15 years 5 months ago
1997
Up-propagation is an algorithm for inverting and learning neural network generative models. Sensory input is processed by inverting a model that generates patterns from hidden var...
124
Voted
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
124
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
125
click to vote
JDA
2010
15 years 2 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
209
Voted
IWPEC
2010
Springer
15 years 1 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...