Sciweavers

28888 search results - page 5687 / 5778
» Computability and complexity in analysis
Sort
View
PLDI
2006
ACM
14 years 3 months ago
Refactoring programs to secure information flows
Adding a sound information flow security policy to an existing program is a difficult task that requires major analysis of and changes to the program. In this paper we show how ...
Scott F. Smith, Mark Thober
SASN
2006
ACM
14 years 3 months ago
Diversify sensor nodes to improve resilience against node compromise
A great challenge in securing sensor networks is that sensor nodes can be physically compromised. Once a node is compromised, attackers can retrieve secret information (e.g. keys)...
Abdulrahman Alarifi, Wenliang Du
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 3 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
BIBE
2005
IEEE
14 years 2 months ago
Selecting Informative Genes from Microarray Dataset by Incorporating Gene Ontology
Selecting informative genes from microarray experiments is one of the most important data analysis steps for deciphering biological information imbedded in such experiments. Howev...
Xian Xu, Aidong Zhang
BROADNETS
2005
IEEE
14 years 2 months ago
Modeling and performance evaluation of ISCSI storage area networks
Abstract— This paper provides a concise modeling and performance evaluation of the iSCSI storage area network (SAN) architecture and protocol. SANs play a key role in business co...
Christoph M. Gauger, Martin Köhn, Sebastian G...
« Prev « First page 5687 / 5778 Last » Next »