1359 search results - page 29 / 272 » Probabilistic Points-to Analysis |
TIT
2008
13 years 8 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
AUTOMATICA
2002
13 years 8 months ago
2002
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
AAAI
1994
13 years 9 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
CIVR
2008
Springer
13 years 10 months ago
2008
Springer
We present a probabilistic ranking-driven classifier for the detection of video semantic concept, such as airplane, building, etc. Most existing concept detection systems utilize ...
DRR
2003
13 years 9 months ago
2003
The difficulty with information retrieval for OCR documents lies in the fact that OCR documents comprise of a significant amount of erroneous words and unfortunately most informat...