1728 search results - page 243 / 346 » The Accelerated Euclidean Algorithm |
130
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
114
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, howev...
141
click to vote
MOBIHOC
2001
ACM
16 years 2 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
110
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
119
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract – This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the ...