876 search results - page 50 / 176 » Complexity in geometric SINR |
TSP
2008
13 years 7 months ago
2008
In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multipleoutput (...
COMPGEOM
2003
ACM
14 years 26 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
SIGACT
2008
13 years 7 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Image based rendering is an attractive alternative for generating novel views compared to model based rendering due to its lower complexity and potential for photo-realistic resul...
COMPGEOM
2004
ACM
14 years 1 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...