3708 search results - page 162 / 742 » Approximating Betweenness Centrality |
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
116
Voted
NETGAMES
2003
ACM
15 years 6 months ago
2003
ACM
Abstract— Multiplayer games become increasingly popular, mostly because they involve interaction among humans. Typically, multiplayer games are organized based on a Client-Server...
111
Voted
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
91
Voted
CIE
2010
Springer
15 years 5 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...
104
click to vote
ADBIS
2010
Springer
15 years 2 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...