Sciweavers

3684 search results - page 390 / 737
» Generic Support for Distributed Applications
Sort
View
LCN
2008
IEEE
16 years 1 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
158
Voted
ICML
2006
IEEE
16 years 7 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
ICDE
2008
IEEE
200views Database» more  ICDE 2008»
16 years 1 months ago
Enforcing security in semantics driven policy based networks
— Security is emerging as an important requirement for a number of distributed applications such as online banking, social networking etc. due to the private nature of the data b...
Palanivel Balaji Kodeswaran, Sethuram Balaji Kodes...
ASAP
2007
IEEE
95views Hardware» more  ASAP 2007»
16 years 1 months ago
Performance Evaluation of Probe-Send Fault-tolerant Network-on-chip Router
With increasing reliability concerns for current and next generation VLSI technologies, fault-tolerance is fast becoming an integral part of system-on-chip and multicore architect...
Sumit D. Mediratta, Jeffrey T. Draper
188
Voted
SASO
2007
IEEE
16 years 1 months ago
Identifying Malicious Peers Before It's Too Late: A Decentralized Secure Peer Sampling Service
Many unstructured peer to peer (P2P) systems rely on a Peer Sampling Service (PSS) that returns randomly sampled nodes from the population comprising the system. PSS protocols are...
Gian Paolo Jesi, David Hales, Maarten van Steen