Sciweavers

1060 search results - page 91 / 212
» Notes on Coding Theory
Sort
View
JCT
1998
193views more  JCT 1998»
15 years 6 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
CHI
2009
ACM
16 years 6 months ago
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira ...
WWW
2007
ACM
16 years 7 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 4 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
EUROCRYPT
2008
Springer
15 years 8 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki