Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
—Subspace-based blind and group-blind space-time multiuser detection is invoked for a smart antenna aided generalized MC DS-CDMA system communicating over a dispersive Space-Time...
Recently, there have been proposals for scaling-up a database system using lazy replication. In these proposals, system scale-up is achieved through the addition of secondary site...
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
—Self-organizing networks (SON) is commonly seen as a way to increase network performance while simplifying its management. This paper investigates Packet Scheduling (PS) in the ...