Sciweavers

52 search results - page 7 / 11
» Characterizing Provability in
Sort
View
COLT
2003
Springer
14 years 3 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
We investigate the all-or-nothing encryption paradigm which was introduced by Rivest as a new mode of operation for block ciphers. The paradigm involves composing an all-or-nothing...
Anand Desai
DATE
2008
IEEE
111views Hardware» more  DATE 2008»
14 years 4 months ago
A Formal Approach To The Protocol Converter Problem
In the absence of a single module interface standard, integration of pre-designed modules in System-on-Chip design often requires the use of protocol converters. Existing approach...
Karin Avnit, Vijay D'Silva, Arcot Sowmya, S. Rames...
KRDB
2003
111views Database» more  KRDB 2003»
13 years 11 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf