336 search results - page 22 / 68 » Improved data structures for fully dynamic biconnectivity |
132
click to vote
PAMI
2012
13 years 2 months ago
2012
—This paper is concerned with the representation and recognition of the observed dynamics (i.e., excluding purely spatial appearance cues) of spacetime texture based on a spatiot...
139
click to vote
SSD
1993
Springer
15 years 3 months ago
1993
Springer
: Spatial data types or algebras for database systems should (i) be fully general (which means, closed under set operations, hence e.g. a region value can be a set of polygons with...
144
click to vote
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
120
click to vote
IJFCS
2002
14 years 11 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
104
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...