Sciweavers

384 search results - page 32 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
ACL
2010
13 years 5 months ago
Fine-Grained Genre Classification Using Structural Learning Algorithms
Prior use of machine learning in genre classification used a list of labels as classification categories. However, genre classes are often organised into hierarchies, e.g., coveri...
Zhili Wu, Katja Markert, Serge Sharoff
FOCS
2003
IEEE
14 years 1 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
FM
2001
Springer
108views Formal Methods» more  FM 2001»
14 years 6 days ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
LICS
1998
IEEE
13 years 12 months ago
Existential Second-Order Logic over Strings
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
Thomas Eiter, Georg Gottlob, Yuri Gurevich