1208 search results - page 194 / 242 » Uniform eventown problems |
154
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
169
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
177
click to vote
SIAMCOMP
2012
13 years 6 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
170
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Recently, the wide deployment of practical face recognition systems gives rise to the emergence of the inter-modality face recognition problem. In this problem, the face images in ...
234
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...