2434 search results - page 346 / 487 » Algorithmic Randomness of Closed Sets |
150
click to vote
PROVSEC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
130
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
129
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
131
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
127
Voted
ICMI
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents Latent Semantic Googling, a variant of Landauer’s Latent Semantic Indexing that uses the Google search engine to judge the semantic closeness of sets of word...