13214 search results - page 27 / 2643 » Pseudorandomness for network algorithms |
149
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
176
click to vote
TON
2012
13 years 8 months ago
2012
—The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It also presents new challenges to the classical problem of int...
152
click to vote
ICIP
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
144
Voted
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
135
click to vote
APNOMS
2006
Springer
15 years 9 months ago
2006
Springer
The explosive growth of new multimedia services over the Internet necessitates efficient network management. Improved network management systems are expected to simultaneously prov...