2808 search results - page 245 / 562 » Routing betweenness centrality |
164
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
159
click to vote
ADBIS
2010
Springer
15 years 8 months ago
2010
Springer
Medical Information Systems (MIS) in general, like any other complex and large system, can be based on centralized or distributed DBMS. Centralized system is much easier for implem...
162
click to vote
CN
2008
15 years 6 months ago
2008
Electrical-to-optical domain conversions and vice versa (denoted by O/E/O conversions) for each hop in optical core transport networks impose considerable capital and financial ov...
172
click to vote
VLSID
2001
IEEE
16 years 7 months ago
2001
IEEE
Networking hardware manufacturers face the dual demands of supporting ever increasing bandwidth requirements, while also delivering new features, such as the ability to implement ...
186
click to vote
MOBICOM
2009
ACM
16 years 1 months ago
2009
ACM
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...