Sciweavers

516 search results - page 51 / 104
» Sets of k-Independent Strings
Sort
View
FUIN
2002
92views more  FUIN 2002»
13 years 8 months ago
Characterization Results for Time-Varying Codes
Time-varying codes associate variable length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in [8] as a pro...
Ferucio Laurentiu Tiplea, Erkki Mäkinen, Drag...
FOCS
2009
IEEE
14 years 3 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
IWQOS
2004
Springer
14 years 2 months ago
Robust communications for sensor networks in hostile environments
— Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads ...
Ossama Younis, Sonia Fahmy, Paolo Santi
ICML
2005
IEEE
14 years 9 months ago
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers
We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists ...
François Laviolette, Mario Marchand
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 9 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...