1387 search results - page 141 / 278 » Convexity in Discrete Space |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
This paper describes the application of genetic programming to synthesize a small form factor, 2 dimensional wire antenna for a 5.2 GHz 802.11a wireless LAN application. Utilizing ...
MICCAI
2006
Springer
14 years 11 months ago
2006
Springer
The concept of the Logarithm of the Odds (LogOdds) is frequently used in areas such as artificial neural networks, economics, and biology. Here, we utilize LogOdds for a shape repr...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...