11 search results - page 1 / 3 » On the Kernelization Complexity of Colorful Motifs |
143
Voted
IWPEC
2010
Springer
14 years 7 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...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, a novel multi-cue collaborative kernel tracking algorithm is proposed. A new constraint based on the property of cross ratio invariant enables tracking of objects i...
102
click to vote
ASP
2005
Springer
15 years 2 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
ACID
2006
14 years 10 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
CVPR
2012
IEEE
12 years 11 months ago
2012
IEEE
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...