358 search results - page 61 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
108
click to vote
TIT
2011
14 years 8 months ago
2011
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
111
Voted
IPTPS
2005
Springer
15 years 7 months ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
159
Voted
ICDCS
2012
IEEE
13 years 4 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
112
Voted
MICCAI
2004
Springer
16 years 2 months ago
2004
Springer
Abstract. This paper presents a novel method for photorealistic rendering of the bronchial lumen by directly deriving matched shading and texture parameters from video bronchoscope...
HPCA
2008
IEEE
16 years 2 months ago
2008
IEEE
A conceptually appealing approach to supporting a broad range of workloads is a system comprising many small cores that can be fused, on demand, into larger cores. We demonstrate ...