39 search results - page 6 / 8 » SPEED: Symbolic Complexity Bound Analysis |
99
Voted
GLOBECOM
2007
IEEE
14 years 9 months ago
2007
IEEE
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
TWC
2008
14 years 9 months ago
2008
Abstract-- We present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems by generalizing Heller's classical feedback decoding...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
100
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...