Sciweavers

CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 9 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi
IJCV
2000
102views more  IJCV 2000»
13 years 11 months ago
Morphable Surface Models
Abstract. We describe a novel automatic technique for finding a dense correspondence between a pair of n-dimensional surfaces with arbitrary topologies. This method employs a diffe...
Christian R. Shelton
ICPADS
1998
IEEE
14 years 3 months ago
Fault Tolerant All-to-All Broadcast in General Interconnection Networks
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin, Keqin ...
ECCV
2010
Springer
14 years 4 months ago
Shape Analysis of Planar Objects with Arbitrary Topologies using Conformal Geometry
The study of 2D shapes is a central problem in the field of computer vision. In 2D shape analysis, classification and recognition of objects from their observed silhouette are e...
IEEEARES
2006
IEEE
14 years 5 months ago
Web Service Discovery, Replication, and Synchronization in Ad-Hoc Networks
Mobile ad-hoc networks with their arbitrary topologies are a difficult domain for providing highly available Web services. Since hosts can move unpredictably, finding services a...
Lukasz Juszczyk, Jaroslaw Lazowski, Schahram Dustd...
GLOBECOM
2009
IEEE
14 years 6 months ago
Channel Aware Distributed Random Access
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...
Guowang Miao, Ye (Geoffrey) Li, Ananthram Swami