3775 search results - page 10 / 755 » The Expression Problem Revisited |
WABI
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
CCCG
2007
13 years 8 months ago
2007
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
JDA
2010
13 years 5 months ago
2010
TAMC
2010
Springer
13 years 5 months ago
2010
Springer