Sciweavers

231 search results - page 33 / 47
» Two lower bounds for self-assemblies at temperature 1
Sort
View
GD
1999
Springer
15 years 1 months ago
Drawing Planar Graphs with Circular Arcs
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
C. C. Cheng, Christian A. Duncan, Michael T. Goodr...
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 9 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
RECOMB
2008
Springer
15 years 9 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg
VLDB
2004
ACM
106views Database» more  VLDB 2004»
15 years 2 months ago
On The Marriage of Lp-norms and Edit Distance
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
Lei Chen 0002, Raymond T. Ng
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...