Sciweavers

785 search results - page 127 / 157
» Binary Join Trees
Sort
View
EGH
2011
Springer
13 years 9 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
IACR
2011
127views more  IACR 2011»
13 years 9 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...
BMCBI
2010
164views more  BMCBI 2010»
14 years 9 months ago
Pan-genome sequence analysis using Panseq: an online tool for the rapid analysis of core and accessory genomic regions
Background: The pan-genome of a bacterial species consists of a core and an accessory gene pool. The accessory genome is thought to be an important source of genetic variability i...
Chad Laing, Cody Buchanan, Eduardo N. Taboada, Yon...
FSTTCS
2009
Springer
15 years 4 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
RECOMB
2004
Springer
15 years 10 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp