Sciweavers

3946 search results - page 74 / 790
» The computational complexity of choice sets
Sort
View
IJSI
2008
91views more  IJSI 2008»
14 years 12 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
15 years 6 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
ETS
2009
IEEE
117views Hardware» more  ETS 2009»
14 years 9 months ago
A Two Phase Approach for Minimal Diagnostic Test Set Generation
We optimize the full-response diagnostic fault dictionary from a given test set. The smallest set of vectors is selected without loss of diagnostic resolution of the given test se...
Mohammed Ashfaq Shukoor, Vishwani D. Agrawal
COLT
2000
Springer
15 years 3 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
ICLP
2009
Springer
16 years 14 days ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...