240 search results - page 43 / 48 » Maximal Contiguous Degrees |
160
click to vote
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
139
Voted
MOBIHOC
2003
ACM
16 years 3 months ago
2003
ACM
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...
139
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
134
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
157
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...