3244 search results - page 106 / 649 » On convex complexity measures |
118
click to vote
GD
1998
Springer
15 years 5 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
129
click to vote
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
110
click to vote
ICC
2000
IEEE
15 years 6 months ago
2000
IEEE
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
114
click to vote
JCDCG
2000
Springer
15 years 5 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...