Sciweavers

534 search results - page 3 / 107
» Power from Random Strings
Sort
View
LREC
2008
130views Education» more  LREC 2008»
14 years 11 months ago
ParsCit: an Open-source CRF Reference String Parsing Package
We describe ParsCit, a freely available, open-source implementation of a reference string parsing package. At the core of ParsCit is a trained conditional random field (CRF) model...
Isaac G. Councill, C. Lee Giles, Min-Yen Kan
ECCC
1998
80views more  ECCC 1998»
14 years 9 months ago
Extracting All the Randomness from a Weakly Random Source
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
Salil P. Vadhan
ICALP
2005
Springer
15 years 3 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
FOCS
2000
IEEE
15 years 2 months ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
IPPS
1998
IEEE
15 years 2 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand