Sciweavers

3553 search results - page 37 / 711
» Association Computation for Information Access
Sort
View
CGO
2003
IEEE
15 years 7 months ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein
HICSS
2009
IEEE
98views Biometrics» more  HICSS 2009»
15 years 8 months ago
Replicating and Sharing Computer Security Laboratory Environments
Many institutions are currently investigating the feasibility of creating Computer Security Laboratory environments for their researchers and students. This paper compares four of...
Kara L. Nance, Brian Hay, Ronald Dodge, James Wrub...
IADIS
2004
15 years 3 months ago
Relevance feedback using semantic association between indexing terms in large free text corpuses
Relevance feedback has been considered as a means of incorporating learning into information retrieval systems for quite sometime now. This paper discusses the research results of...
Shahzad Khan, Kenan Azam
TACAS
2010
Springer
162views Algorithms» more  TACAS 2010»
15 years 9 months ago
Computing the Leakage of Information-Hiding Systems
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
15 years 8 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol