165 search results - page 13 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
96
Voted
WG
2001
Springer
15 years 4 months ago
2001
Springer
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...
COCO
2005
Springer
15 years 5 months ago
2005
Springer
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...
69
Voted
MOC
1998
14 years 11 months ago
1998
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...
HAPTICS
2005
IEEE
15 years 5 months ago
2005
IEEE
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...
124
click to vote
HYBRID
2000
Springer
15 years 3 months ago
2000
Springer
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...