5115 search results - page 374 / 1023 » On Randomized Lanczos Algorithms |
120
Voted
RSA
1998
15 years 7 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
210
click to vote
TDHMS
2008
15 years 5 months ago
2008
In this paper, well-known attacks named oracle attacks are formulated within a realistic network communication model where they reveal to use suitable covert channels, we name orac...
190
Voted
INLG
2010
Springer
15 years 5 months ago
2010
Springer
We describe our contribution to the Generation Challenge 2010 for the tasks of Named Entity Recognition and coreference detection (GREC-NER). To extract the NE and the referring e...
243
click to vote
PROPERTYTESTING
2010
15 years 5 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
229
click to vote
ICDAR
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper presents a new approach for the binarization of seriously degraded manuscript. We introduce a new technique based on a Markov Random Field (MRF) model of the document. ...