A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Recently, mashups have emerged as an important class of Web 2.0 collaborative applications. Mashups can be conceived as personalized Web services which aggregate and manipulate dat...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
—This paper proposes a cooperative space-time coding (STC) protocol, amalgamating the concepts of asynchronous cooperation, non-coherent detection as well as Distributed Turbo Co...
3G cellular data networks have recently witnessed explosive growth. In this work, we focus on UMTS, one of the most popular 3G mobile communication technologies. Our work is the f...