1887 search results - page 260 / 378 » An efficient search algorithm for partially ordered sets |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider a two-hop wireless network where a transmitter communicates with a receiver via M relays with an amplify-and-forward (AF) protocol. Recent works have shown that sophis...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper proposes a new method for the selection of sets of omnidirectional views, which contribute together to the efficient representation of a 3D scene. When the 3D surface i...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
PODS
1995
ACM
14 years 20 days ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...