2571 search results - page 477 / 515 » Approximation schemes for wireless networks |
160
Voted
WEA
2007
Springer
16 years 11 hour ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
130
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
153
click to vote
UAI
2008
15 years 7 months ago
2008
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
175
click to vote
NSDI
2010
15 years 7 months ago
2010
Current WiFi Access Points (APs) choose transmission parameters when emitting wireless packets based solely on channel conditions. In this work we explore the benefits of deciding...
188
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract— Optimizing TCP (Transport Layer) for mobility has been researched extensively. We present a brief summary of existing results which indicates that most schemes require ...