11909 search results - page 430 / 2382 » The Scheme Programming Language |
194
click to vote
ICALP
2001
Springer
16 years 2 days ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
229
click to vote
ECOOP
1998
Springer
15 years 12 months ago
1998
Springer
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
219
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
224
click to vote
ICALP
2011
Springer
14 years 11 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
236
click to vote
JMLR
2012
13 years 10 months ago
2012
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...