Sciweavers

7683 search results - page 1415 / 1537
» Distributed Computing with the CLAN Network
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
120
Voted
AUIC
2006
IEEE
15 years 9 months ago
TIDL: mixed presence groupware support for legacy and custom applications
In this paper, we present a framework to use an arbitrary number of mouse and keyboard input devices controlling Swing based Java applications. These devices can be distributed am...
Peter Hutterer, Benjamin Close, Bruce H. Thomas
IMC
2006
ACM
15 years 9 months ago
A multifaceted approach to understanding the botnet phenomenon
The academic community has long acknowledged the existence of malicious botnets, however to date, very little is known about the behavior of these distributed computing platforms....
Moheeb Abu Rajab, Jay Zarfoss, Fabian Monrose, And...
IPPS
2005
IEEE
15 years 9 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
108
Voted
PODC
2003
ACM
15 years 9 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
« Prev « First page 1415 / 1537 Last » Next »