Sciweavers

8540 search results - page 1648 / 1708
» The Dynamic Servers Problem
Sort
View
SOUPS
2006
ACM
15 years 3 months ago
Seeing further: extending visualization as a basis for usable security
The focus of our approach to the usability considerations of privacy and security has been on providing people with information they can use to understand the implications of thei...
Jennifer Ann Rode, Carolina Johansson, Paul DiGioi...
DSN
2005
IEEE
15 years 3 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
ECRTS
2005
IEEE
15 years 3 months ago
Cache Contents Selection for Statically-Locked Instruction Caches: An Algorithm Comparison
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
Antonio Martí Campoy, Isabelle Puaut, Angel...
INFOCOM
2005
IEEE
15 years 3 months ago
Improving VoIP quality through path switching
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...
Shu Tao, Kuai Xu, Antonio Estepa, Teng Fei, Lixin ...
IV
2005
IEEE
81views Visualization» more  IV 2005»
15 years 3 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
« Prev « First page 1648 / 1708 Last » Next »