Sciweavers

484 search results - page 82 / 97
» Large graph processing in the cloud
Sort
View
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
74
Voted
3DPVT
2006
IEEE
170views Visualization» more  3DPVT 2006»
15 years 3 months ago
Minimum Spanning Tree Pose Estimation
The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter ...
Kevin L. Steele, Parris K. Egbert
KBSE
2006
IEEE
15 years 3 months ago
A Portable Compiler-Integrated Approach to Permanent Checking
Program checking technology is now a mature technology, but is not yet used on a large scale. We identify one cause of this gap in the decoupling of checking tools from the everyd...
Eugen-Nicolae Volanschi
MSWIM
2006
ACM
15 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
EEE
2005
IEEE
15 years 3 months ago
Towards Effective Web Site Designs: A Framework for Modeling, Design Evaluation and Enhancement
Effective Web site design is critical to the success of e-commerce. Therefore, the evaluation and enhancement of a Web site design is of great importance. In this vein, accessibil...
Benjamin Yen, Paul Jen-Hwa Hu, May Wang