Sciweavers

86 search results - page 3 / 18
» Generalized Balanced Partitions of Two Sets of Points in the...
Sort
View
ICS
2009
Tsinghua U.
13 years 12 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
EJC
2007
13 years 7 months ago
Proof of the oval conjecture for planar partition functions
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...
Nils Rosehr
CCCG
2010
13 years 8 months ago
Compatible pointed pseudo-triangulations
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
COMGEO
2006
ACM
13 years 7 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy