92 search results - page 12 / 19 » On Maximal S-Free Convex Sets |
IPCO
2004
15 years 1 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
Efficient design of wireless networks requires implementation of cross-layer algorithms that exploit channel state information. Capitalizing on convex optimization and stochastic...
JCO
2010
14 years 10 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
TWC
2010
14 years 6 months ago
2010
We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a vari...
84
Voted
TWC
2008
14 years 11 months ago
2008
The distance between nodes in a wireless sensor network (WSN) is an important factor in the performance that can be extracted from the network for many tasks. However, the distanc...