973 search results - page 62 / 195 » New Bounds on Crossing Numbers |
207
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
225
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
166
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
203
click to vote
GD
2004
Springer
16 years 5 days ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
202
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...