1414 search results - page 127 / 283 » Randomness and Universal Machines |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...