Sciweavers

1016 search results - page 199 / 204
» Network aware time management and event distribution
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 3 days ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
IPTPS
2004
Springer
15 years 5 months ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...
NOSSDAV
1991
Springer
15 years 3 months ago
Multimedia Synchronization and UNIX
One of the most important emerging developments for improving the user/computer interface has been the addition of multimedia facilities to high-performance workstations. Although...
Dick C. A. Bulterman, Robert van Liere
PODC
2009
ACM
16 years 7 days ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
EMSOFT
2005
Springer
15 years 5 months ago
Passive mid-stream monitoring of real-time properties
Passive monitoring or testing of complex systems and networks running in the field can provide valuable insights into their behavior in actual environments of use. In certain con...
Lalita Jategaonkar Jagadeesan, Ramesh Viswanathan