12825 search results - page 1872 / 2565 » Improved PLSOM algorithm |
196
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
154
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...
227
click to vote
COMGEO
2006
ACM
15 years 7 months ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
261
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
182
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...