275 search results - page 44 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
100
click to vote
GBRPR
2009
Springer
14 years 9 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
VIS
2006
IEEE
16 years 29 days ago
2006
IEEE
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
109
click to vote
AAAI
2012
13 years 2 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
96
Voted
SIGCSE
2002
ACM
14 years 11 months ago
2002
ACM
Most courses on Discrete Mathematics are designed to emphasize problem solving, in general. When the goal is to cover the content, the learning and understanding takes a second pl...