103 search results - page 4 / 21 » An improved bound on the number of unit area triangles |
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
Conventional high-level synthesis algorithms usually employ multi-cycle operators to reduce the cycle length in order to improve the circuit performance. These operators need seve...
COMPGEOM
2010
ACM
14 years 27 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
SIROCCO
2007
13 years 9 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
ENGL
2008
13 years 7 months ago
2008
This is a theoretical and experimental study of microstrip reflectarray useable in wireless local area networks (WLAN). The effectiveness of reducing the unit cell size of microstr...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...