Sciweavers

1346 search results - page 13 / 270
» On the number of rectangular partitions
Sort
View
LCPC
2004
Springer
14 years 2 days ago
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
Arun Kejariwal, Paolo D'Alberto, Alexandru Nicolau...
PAMI
2011
13 years 1 months ago
Applying Property Testing to an Image Partitioning Problem
—Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, und...
Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-...
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 6 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
ISAAC
2004
Springer
117views Algorithms» more  ISAAC 2004»
14 years 2 days ago
Adaptive Spatial Partitioning for Multidimensional Data Streams
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
13 years 6 months ago
Approximating the Domatic Number
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
Uriel Feige, Magnús M. Halldórsson, ...