2432 search results - page 30 / 487 » Degrees and choice numbers |
116
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
106
click to vote
APAL
2010
15 years 2 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
119
click to vote
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
122
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In cellular networks, relays and/or mobiles can cooperate to improve the overall system performance. For example, once the transmission from a base station with multiple antenn...
119
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...