Sciweavers

2642 search results - page 213 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
SAC
2010
ACM
16 years 1 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
ICDE
2002
IEEE
110views Database» more  ICDE 2002»
16 years 7 months ago
A Publish & Subscribe Architecture for Distributed Metadata Management
The emergence of electronic marketplaces and other electronic services and applications on the Internet is creating a growing demand for effective management of resources. Due to ...
Markus Keidl, Alexander Kreutz, Alfons Kemper, Don...
HPDC
2005
IEEE
16 years 3 days ago
Interest-aware information dissemination in small-world communities
Information dissemination is a fundamental and frequently occuring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware info...
Adriana Iamnitchi, Ian T. Foster
ERSA
2006
133views Hardware» more  ERSA 2006»
15 years 8 months ago
An FPGA based Co-Design Architecture for MIMO Lattice Decoders
MIMO systems have attracted great attentions because of their huge capacity. The hardware implementation of MIMO decoder becomes a challenging task as the complexity of the MIMO sy...
Cao Liang, Jing Ma, Xin-Ming Huang
TCOM
2008
151views more  TCOM 2008»
15 years 6 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