— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
: In modern organisations the monolithic information systems of the past are being gradually replaced by networked systems, enabling distributed computing often based on multi-agen...
Academic research sometimes suffers from the “ivory tower” problem: some ideas that sound good in theory do not necessarily work well in practice. An example of research that ...
Joseph E. Hollingsworth, Lori Blankenship, Bruce W...
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...