242 search results - page 40 / 49 » Object-level Vertical Search |
174
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
166
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
156
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
146
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
136
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...