1302 search results - page 60 / 261 » On the Strong Chromatic Number |
180
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
- In the general case of non-uniformly spaced frequency domain data and/or arbitrarily colored disturbing noise, the frequency domain subspace identification algorithms described i...
170
click to vote
CHES
2004
Springer
15 years 11 months ago
2004
Springer
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
166
click to vote
CHI
1999
ACM
15 years 10 months ago
1999
ACM
The widespread use of information visualization is hampered by the lack of effective labeling techniques. A taxonomy of labeling methods is proposed. We then describe “excentric...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
163
click to vote
DLT
2006
15 years 7 months ago
2006
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...