Sciweavers

3145 search results - page 528 / 629
» Algebraic Linear Orderings
Sort
View
MFCS
2009
Springer
15 years 8 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
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...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
CAV
2001
Springer
121views Hardware» more  CAV 2001»
15 years 8 months ago
A Practical Approach to Coverage in Model Checking
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
Hana Chockler, Orna Kupferman, Robert P. Kurshan, ...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 8 months ago
Query Evaluation via Tree-Decompositions
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...
Jörg Flum, Markus Frick, Martin Grohe
ICSE
2001
IEEE-ACM
15 years 8 months ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
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...
Tim Menzies, John D. Powell, Michael E. Houle
SACRYPT
2001
Springer
123views Cryptology» more  SACRYPT 2001»
15 years 8 months ago
Weaknesses in the Key Scheduling Algorithm of RC4
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...
Scott R. Fluhrer, Itsik Mantin, Adi Shamir