Sciweavers

549 search results - page 51 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
COMSIS
2010
14 years 7 months ago
A content-based dynamic load-balancing algorithm for heterogeneous web server cluster
According to the different requests of Web and the heterogeneity of Web server, the paper presents a content-based loadbalancing algorithm. The mechanism of this algorithm is that ...
Lin Zhang, Xiao Ping Li, Su Yuan
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
15 years 10 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
PVLDB
2010
220views more  PVLDB 2010»
14 years 4 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
ECCV
2008
Springer
14 years 11 months ago
Image Segmentation in the Presence of Shadows and Highlights
The segmentation method proposed in this paper is based on the observation that a single physical reflectance can have many different image values. We call the set of all these val...
Eduard Vazquez, Joost van de Weijer, Ramon Baldric...
CAD
2004
Springer
14 years 9 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...