215 search results - page 32 / 43 » Approximating Geometrical Graphs via |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
DIALM
2004
ACM
14 years 3 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
13 years 9 months ago
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...