Sciweavers

4313 search results - page 755 / 863
» Using time travel to diagnose computer problems
Sort
View
ECCC
1998
105views more  ECCC 1998»
13 years 8 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
ISBRA
2010
Springer
13 years 7 months ago
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure
The random accumulation of variations in the human genome over time implicitly encodes a history of how human populations have arisen, dispersed, and intermixed since we emerged as...
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell S...
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
14 years 3 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
BMCBI
2006
192views more  BMCBI 2006»
13 years 9 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 10 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli