We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
Abstract—In modern DSL networks, crosstalk among different lines (i.e., users) is the major source of performance degradation. Dynamic Spectrum Management (DSM) refers to a set o...
Paschalis Tsiaflakis, Yung Yi, Mung Chiang, Marc M...
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...