Sciweavers

406 search results - page 62 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
IJAC
2011
13 years 1 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 4 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
WABI
2007
Springer
110views Bioinformatics» more  WABI 2007»
14 years 4 months ago
Haplotype Inference Via Hierarchical Genotype Parsing
The within-species genetic variation due to recombinations leads to a mosaic-like structure of DNA. This structure can be modeled, e.g. by parsing sample sequences of current DNA w...
Pasi Rastas, Esko Ukkonen
ECAL
2005
Springer
14 years 3 months ago
Biological Development of Cell Patterns: Characterizing the Space of Cell Chemistry Genetic Regulatory Networks
Abstract. Genetic regulatory networks (GRNs) control gene expression and are responsible for establishing the regular cellular patterns that constitute an organism. This paper intr...
Nicholas S. Flann, Jing Hu, Mayank Bansal, Vinay P...