1941 search results - page 295 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
104
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
COR
2008
14 years 10 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
108
click to vote
JAIR
2010
14 years 8 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Analyzing TCP operation over 802.11 multihop ad hoc networks involves a cross-layer study. In this work, we investigate the effect of congestion and MAC contention on the interact...