6437 search results - page 169 / 1288 » Parallel Algorithms for Arrangements |
85
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data ha...
116
click to vote
AAAI
2000
15 years 4 months ago
2000
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
118
click to vote
ICDM
2008
IEEE
15 years 9 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
136
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
102
click to vote
VLSID
2002
IEEE
16 years 3 months ago
2002
IEEE
Various calculation of matrices and vectors has been used in many digital signal processing systems. Although the calculation simply repeats multiplication and addition, the reite...