417 search results - page 65 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
ECCV
2008
Springer
14 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
SIGSOFT
1995
ACM
13 years 11 months ago
1995
ACM
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
OTM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
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...