Sciweavers

42 search results - page 8 / 9
» On the Maximum Cardinality Search Lower Bound for Treewidth
Sort
View
ICC
2009
IEEE
167views Communications» more  ICC 2009»
14 years 11 days ago
Diversity Analysis of Bit-Interleaved Coded Multiple Beamforming
—In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their pr...
Hong Ju Park, Ender Ayanoglu
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 5 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
TCOM
2008
151views more  TCOM 2008»
13 years 5 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 3 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
SPAA
2005
ACM
13 years 11 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...