2593 search results - page 63 / 519 » Algorithms and Data Structures for Computer Topology |
124
click to vote
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
114
click to vote
RECOMB
2001
Springer
15 years 6 months ago
2001
Springer
High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and fu...
116
click to vote
DAGM
2006
Springer
15 years 6 months ago
2006
Springer
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
115
click to vote
ICGI
2004
Springer
15 years 7 months ago
2004
Springer
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
132
click to vote
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....