4860 search results - page 535 / 972 » SNPs Problems, Complexity, and Algorithms |
158
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
155
click to vote
WG
2004
Springer
16 years 5 days ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
164
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
208
click to vote
PODS
2000
ACM
15 years 11 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
168
click to vote
GRAPHICSINTERFACE
2007
15 years 8 months ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...