Sciweavers

2517 search results - page 178 / 504
» Specifying Weak Sets
Sort
View
JDA
2011
104views more  JDA 2011»
15 years 1 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
TCBB
2011
15 years 1 months ago
Visual Exploration across Biomedical Databases
Abstract—Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database e...
Michael D. Lieberman, Sima Taheri, Huimin Guo, Fat...
KBSE
2002
IEEE
15 years 11 months ago
SeDiTeC - Testing Based on Sequence Diagrams
In this paper we present a concept for automated testing of object-oriented applications and a tool called SeDiTeC that implements these concepts for Java applications. SeDiTeC us...
Falk Fraikin, Thomas Leonhardt
CORR
2006
Springer
154views Education» more  CORR 2006»
15 years 6 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
DM
2006
87views more  DM 2006»
15 years 6 months ago
A vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
Anne Berry, Pinar Heggernes, Yngve Villanger