Sciweavers

4378 search results - page 365 / 876
» On the Complexity of Ordered Colourings
Sort
View
VLSISP
2002
103views more  VLSISP 2002»
15 years 6 months ago
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
Albert M. Chan, Gregory W. Wornell
PVLDB
2008
103views more  PVLDB 2008»
15 years 6 months ago
A request-routing framework for SOA-based enterprise computing
Enterprises may use a service-oriented architecture (SOA) to provide a streamlined interface to their business processes. To scale up the system, each tier in a composite service ...
Thomas Phan, Wen-Syan Li
ECCC
2010
106views more  ECCC 2010»
15 years 5 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
IEEECIT
2010
IEEE
15 years 5 months ago
A P2P REcommender System based on Gossip Overlays (PREGO)
—Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building an...
Matteo Mordacchini, Ranieri Baraglia, Patrizio Daz...
ISOLA
2010
Springer
15 years 5 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...