6251 search results - page 224 / 1251 » Randomness, Computability, and Density |
119
click to vote
COLING
2010
14 years 11 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
165
click to vote
DCG
2011
14 years 11 months ago
2011
To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The gen...
128
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
161
click to vote
GI
2003
Springer
15 years 9 months ago
2003
Springer
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
146
click to vote
DCG
2008
15 years 4 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...