2996 search results - page 223 / 600 » Numberings and Randomness |
174
click to vote
IPL
2006
15 years 6 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
158
click to vote
TIT
2008
15 years 6 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
197
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
172
click to vote
HIPC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
173
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...