307 search results - page 47 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
PDSE
2000
13 years 8 months ago
2000
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ...
BMCBI
2004
13 years 7 months ago
2004
Background: With ever increasing numbers of closely related virus genomes being sequenced, it has become desirable to be able to compare two genomes at a level more detailed than ...
BMCBI
2004
13 years 7 months ago
2004
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
SC
2005
ACM
14 years 29 days ago
2005
ACM
We present the development and use of a novel distributed geohazard modeling environment for the analysis and interpretation of large scale earthquake data sets. Our work demonstr...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...