6293 search results - page 1144 / 1259 » Information Flow Testing |
SIGIR
1999
ACM
14 years 2 months ago
1999
ACM
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
POPL
1998
ACM
14 years 2 months ago
1998
ACM
This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on put...
STOC
1996
ACM
14 years 2 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
CIKM
1993
Springer
14 years 2 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
CF
2007
ACM
14 years 2 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...