Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
In a Distributed Database System (DDBS), transactions on objects can be read requests or write requests in a random manner. The replication algorithm of objects critically affects...
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...