92 search results - page 13 / 19 » Random non-cupping revisited |
134
click to vote
AI
2010
Springer
15 years 1 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
121
Voted
WWW
2006
ACM
16 years 2 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
131
click to vote
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
ICMCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we study the security of an image scrambling algorithm based on Space-Filling Curves (SFC). A random SFC is a pixel permutation that changes the scanning order with...
103
click to vote
PODC
2003
ACM
15 years 6 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...