Sciweavers

5329 search results - page 197 / 1066
» The Weighted Majority Algorithm
Sort
View
NETWORKS
2010
15 years 4 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
NETWORK
2010
122views more  NETWORK 2010»
15 years 1 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
14 years 9 months ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
WWW
2003
ACM
16 years 7 months ago
Web Sessions Clustering with Artificial Ants Colonies
In this paper, we apply AntClust, an ant based clustering algorithm, to the Web usage-mining problem. We define a Web session as a weighted multi-modal vector and we propose an ad...
Gilles Venturini, Nicolas Labroche, Nicolas Monmar...
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
16 years 6 months ago
Approximate distance oracles
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
Mikkel Thorup, Uri Zwick