534 search results - page 103 / 107 » Tight approximation algorithm for connectivity augmentation ... |
TCS
2010
13 years 5 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
ICPPW
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we consider joint optimization of end-to-end data transmission and resource allocation for Wireless-Infrastructured Distributed Cellular Networks (WIDCNs), where ...
COMSWARE
2008
IEEE
13 years 9 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
SIAMIS
2010
13 years 2 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...