5606 search results - page 269 / 1122 » Randomization Techniques for Graphs. |
152
click to vote
SACRYPT
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
137
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
167
click to vote
EDBT
2006
ACM
15 years 8 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
201
click to vote
DAGM
2008
Springer
15 years 8 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
205
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...