Sciweavers

2181 search results - page 199 / 437
» The restriction scaffold problem
Sort
View
CRYPTO
2004
Springer
97views Cryptology» more  CRYPTO 2004»
15 years 8 months ago
Efficient Tree-Based Revocation in Groups of Low-State Devices
Abstract. We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and...
Michael T. Goodrich, Jonathan Z. Sun, Roberto Tama...
BIRTHDAY
2006
Springer
15 years 8 months ago
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
Helmut Seidl, Kumar Neeraj Verma
ECAI
2004
Springer
15 years 8 months ago
Avoiding Data Overfitting in Scientific Discovery: Experiments in Functional Genomics
Functional genomics is a typical scientific discovery domain characterized by a very large number of attributes (genes) relative to the number of examples (observations). The dang...
Dragan Gamberger, Nada Lavrac
CODES
2006
IEEE
15 years 8 months ago
Automatic selection of application-specific instruction-set extensions
In this paper, we present a general and an efficient algorithm for automatic selection of new application-specific instructions under hardware resources constraints. The instructi...
Carlo Galuzzi, Elena Moscu Panainte, Yana Yankova,...
CP
2006
Springer
15 years 8 months ago
Revisiting the Sequence Constraint
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...