Sciweavers

165 search results - page 13 / 33
» Exotic Quantifiers, Complexity Classes, and Complete Problem...
Sort
View
WG
2001
Springer
15 years 7 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...
115
Voted
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
15 years 9 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
MOC
1998
93views more  MOC 1998»
15 years 3 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
HAPTICS
2005
IEEE
15 years 9 months ago
Multi-Modal Perceptualization of Volumetric Data and Its Application to Molecular Docking
In this paper, we present a multi-modal data perceptualization system used to analyze the benefits of augmenting a volume docking problem with other perceptual cues, particularly...
Ross Maciejewski, Seungmoon Choi, David S. Ebert, ...
HYBRID
2000
Springer
15 years 7 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller