2465 search results - page 390 / 493 » Automata on Linear Orderings |
200
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
163
click to vote
ICDT
2001
ACM
15 years 10 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
162
click to vote
ICSE
2001
IEEE-ACM
15 years 10 months ago
2001
IEEE-ACM
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
152
click to vote
SACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...
153
click to vote
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we propose a novel fault-oriented test generation methodology for detection and isolation of faults in analog circuits. Given the description of the circuit-underte...