Sciweavers

549 search results - page 5 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
TALG
2010
86views more  TALG 2010»
14 years 8 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
14 years 4 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
CADE
2010
Springer
14 years 11 months ago
An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
Yevgeny Kazakov
JCIT
2008
99views more  JCIT 2008»
14 years 9 months ago
Iterative Operator-Splitting Methods for Stiff Problems in Complex Applications
In this paper we deal with the Landau-LifshitzGilbert equation which describes dynamics of ferromagnetism. Based on the strong nonlinearities a stabilised discretisation method is...
Jürgen Geiser
RECOMB
2010
Springer
15 years 4 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...