: In ubiquitous application scenarios, the information (processing) needs of nomadic users often cannot be satisfied by a set of pre-installed processes like in common workflow sys...
Klaus Haller, Michelle Ackermann, Claudio Munari, ...
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Over the past few years, a relatively new computing phenomenon has gained momentum: the spread of "spyware." Though most people are aware of spyware, the research commun...
Abstract. In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of pe...