Sciweavers

1691 search results - page 43 / 339
» Restricted subset selection
Sort
View
DM
2010
124views more  DM 2010»
13 years 9 months ago
Asymptotic enumeration of 2-covers and line graphs
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
WISTP
2009
Springer
14 years 3 months ago
Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
Hendrik Tews, Bart Jacobs
ICLP
2009
Springer
14 years 9 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
ESOP
2007
Springer
14 years 3 months ago
Modular Shape Analysis for Dynamically Encapsulated Programs
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard ...
Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Rama...
AAAI
2010
13 years 9 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman