Sciweavers

148 search results - page 12 / 30
» On data structures and asymmetric communication complexity
Sort
View
CF
2009
ACM
14 years 2 months ago
Strategies for dynamic memory allocation in hybrid architectures
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
Peter Bertels, Wim Heirman, Dirk Stroobandt
DEXAW
2004
IEEE
166views Database» more  DEXAW 2004»
13 years 11 months ago
Development of Flexible Peer-To-Peer Information Systems Using Adaptable Mobile Agents
Wide-area networks provide an easy access to many different distributed and heterogeneous data sources. The development of automated operating tools is still complex, particularly...
Jean-Paul Arcangeli, Sebastien Leriche, Marc Pante...
CA
1998
IEEE
13 years 11 months ago
Efficient Network Transmission of Virtual Human Bodies
Integrating virtual human's animation in networked virtual environments (NVEs) has the potential to create severe network load issues. In NVEs, users are represented by their...
Tolga K. Capin, Maja Jovovic, Joaquim Esmerado, Am...
ICC
2008
IEEE
14 years 1 months ago
Unitary Precoding Techniques Based on Transmit-MRC for MIMO Wireless Systems
— This paper proposes a low complexity unitary precoding scheme for multiple-input multiple-output (MIMO) systems. The singular-value decomposition (SVD) based transmission is ca...
Seokhwan Park, Heunchul Lee, Sang-Rim Lee, Inkyu L...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder