Sciweavers

2814 search results - page 561 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
IEEESP
2007
98views more  IEEESP 2007»
13 years 6 months ago
Educating Students to Create Trustworthy Systems
igh level of abstraction and to provide broad oversight. In contrast, the goal of computer science security education is to provide the technicalexpertisetodevelopsecure software a...
Richard S. Swart, Robert F. Erbacher
TON
2008
136views more  TON 2008»
13 years 6 months ago
A geometric approach to improving active packet loss measurement
Abstract-- Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. Whi...
Joel Sommers, Paul Barford, Nick G. Duffield, Amos...
TWC
2008
133views more  TWC 2008»
13 years 6 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
RAS
2007
148views more  RAS 2007»
13 years 5 months ago
Including probabilistic target detection attributes into map representations
Range measuring sensors can play an extremely important role in robot navigation. All range measuring devices rely on a ‘detection criterion’ made in the presence of noise, to...
John Mullane, Ebi Jose, Martin David Adams, Wijeru...
JMLR
2010
157views more  JMLR 2010»
13 years 4 months ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...