584 search results - page 8 / 117 » On the Number of Halving Planes |
WG
2010
Springer
13 years 5 months ago
2010
Springer
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
SAT
2005
Springer
14 years 25 days ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
– We propose a System-on-Chip (SoC) architecture for reconfigurable applications based on the AMBA HighSpeed Bus (AHB). The architecture features multiple low-area flyby DMA bloc...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...