2996 search results - page 33 / 600 » Numberings and Randomness |
100
Voted
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
102
click to vote
COMBINATORICA
2008
15 years 14 days ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
140
Voted
CRYPTO
2005
Springer
15 years 7 months ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
117
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...
121
Voted
IPCO
2007
15 years 3 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...