Sciweavers

49 search results - page 9 / 10
» Extractor codes
Sort
View
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
14 years 20 days ago
Hardness vs. Randomness within Alternating Time
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} ...
Emanuele Viola
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
14 years 1 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
WCRE
2006
IEEE
14 years 1 months ago
Extracting Output Formats from Executables
We describe the design and implementation of FFE/x86 (File-Format Extractor for x86), an analysis tool that works on stripped executables (i.e., neither source code nor debugging ...
Junghee Lim, Thomas W. Reps, Ben Liblit
AINA
2009
IEEE
14 years 2 months ago
CUTER: An Efficient Useful Text Extraction Mechanism
In this paper we present CUTER, a system that processes HTML pages in order to extract the useful text from them. The mechanism is focalized on HTML pages that include news articl...
George Adam, Christos Bouras, Vassilis Poulopoulos