2715 search results - page 417 / 543 » Total Generalized Variation |
157
click to vote
ICNP
2007
IEEE
16 years 23 days ago
2007
IEEE
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
176
click to vote
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
159
click to vote
HM
2007
Springer
16 years 18 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
167
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
202
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...