1219 search results - page 91 / 244 » Where to Look Next |
156
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
122
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Despite primary space-time coding where the channel state information (CSI) is available at the receiver only, the capacity and performance of multiple-input multiple-o...
134
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
121
click to vote
PDCAT
2007
Springer
15 years 10 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
115
click to vote
ICSM
2006
IEEE
15 years 10 months ago
2006
IEEE
E-commerce applications are designed to streamline the business processes for an organization. Graphical user interfaces allow business users to perform daily business activities ...