373 search results - page 52 / 75 » On Markov Chains for Independent Sets |
LCN
2008
IEEE
14 years 1 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
VTS
2003
IEEE
14 years 25 days ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
The first stage of the signal processing chain in a Global Positioning System (GPS) receiver is the acquisition, which provides for a desired satellite coarse code phase and Dopple...
TIT
2010
13 years 2 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
JMLR
2006
13 years 7 months ago
2006
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...