1027 search results - page 74 / 206 » Ordered Vertex Partitioning |
145
click to vote
ICDT
2001
ACM
15 years 7 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
139
click to vote
ALENEX
2008
15 years 4 months ago
2008
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
134
click to vote
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
104
click to vote
EJC
2010
15 years 3 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
102
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...