Sciweavers

1612 search results - page 243 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
CN
2007
154views more  CN 2007»
14 years 9 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
EOR
2007
69views more  EOR 2007»
14 years 9 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
ML
2006
ACM
121views Machine Learning» more  ML 2006»
14 years 9 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
VR
2008
IEEE
175views Virtual Reality» more  VR 2008»
14 years 9 months ago
Managing Visual Clutter: A Generalized Technique for Label Segregation using Stereoscopic Disparity
We present a new technique for managing visual clutter caused by overlapping labels in complex information displays. This technique, "label layering", utilizes stereosco...
Stephen Peterson, Magnus Axholt, Stephen R. Ellis
WWW
2005
ACM
15 years 10 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry