Sciweavers

1487 search results - page 54 / 298
» The Computational Complexity of Link Building
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
15 years 1 months ago
Accuracy estimate and optimization techniques for SimRank computation
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...
Dmitry Lizorkin, Pavel Velikhov, Maxim N. Grinev, ...
CCGRID
2008
IEEE
15 years 1 months ago
Fault Tolerance and Recovery of Scientific Workflows on Computational Grids
In this paper, we describe the design and implementation of two mechanisms for fault-tolerance and recovery for complex scientific workflows on computational grids. We present our ...
Gopi Kandaswamy, Anirban Mandal, Daniel A. Reed
CCGRID
2002
IEEE
15 years 6 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
118
Voted
ECCV
2008
Springer
16 years 3 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
99
Voted
SIGUCCS
2000
ACM
15 years 5 months ago
Putting Help Where the User Is - A Desktop Computer Support Strategy
As the personal computer becomes a more integral part of the faculty member’s job, the increasing level of day-to-day computer support - often without increases in full-time sta...
Cheryl Stahler