1195 search results - page 181 / 239 » What, Where |
DBSEC
2004
13 years 9 months ago
2004
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
JFP
2006
13 years 7 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We wish to match sets of images to sets of images where both sets are undergoing various distortions such as viewpoint and lighting changes. To this end we have developed a Joint ...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—We study two-player security games which can be viewed as sequences of nonzero-sum matrix games where at each stage of the iterations the players make imperfect observations of ...