Sciweavers

1953 search results - page 158 / 391
» codes 2010
Sort
View
SIAMDM
2010
137views more  SIAMDM 2010»
15 years 3 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
TDSC
2010
191views more  TDSC 2010»
15 years 3 months ago
SigFree: A Signature-Free Buffer Overflow Attack Blocker
—We propose SigFree, an online signature-free out-of-the-box application-layer method for blocking code-injection buffer overflow attack messages targeting at various Internet se...
Xinran Wang, Chi-Chun Pan, Peng Liu, Sencun Zhu
119
Voted
MOR
2010
79views more  MOR 2010»
14 years 11 months ago
A Geometric Proof of Calibration
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and ...
Shie Mannor, Gilles Stoltz
ENTCS
2007
104views more  ENTCS 2007»
15 years 4 months ago
Implementing a Distributed Mobile Calculus Using the IMC Framework
In the last decade, many calculi for modelling distributed mobile code have been proposed. To assess their merits and encourage use, implementations of the calculi have often been...
Lorenzo Bettini, Rocco De Nicola, Daniele Falassi,...
CHI
2010
ACM
15 years 9 months ago
Share: a programming environment for loosely bound cooperation
We introduce a programming environment entitled Share that is designed to encourage loosely bound cooperation between individuals within communities of practice through the sharin...
Yannick Assogba, Judith S. Donath