Sciweavers

56 search results - page 4 / 12
» On lovely pairs of geometric structures
Sort
View
COMGEO
1999
ACM
13 years 9 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 4 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
RECOMB
1999
Springer
14 years 2 months ago
Fast detection of common geometric substructure in proteins
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem,...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 3 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan