978 search results - page 45 / 196 » Knowledge, Probability, and Adversaries |
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real...
102
click to vote
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...