139 search results - page 6 / 28 » Computing crossing numbers in quadratic time |
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
FOCS
1998
IEEE
14 years 25 days ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
COMPGEOM
2000
ACM
14 years 29 days 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...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
MOC
1998
13 years 8 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....