269 search results - page 46 / 54 » Who Thinks Who Knows Who |
SIGIR
2005
ACM
14 years 29 days ago
2005
ACM
Accurately and effectively detecting the locations where search queries are truly about has huge potential impact on increasing search relevance. In this paper, we define a search...
CRYPTO
2005
Springer
14 years 28 days ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
GECCO
2003
Springer
14 years 18 days ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
STOC
2010
ACM
14 years 8 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
EUROCRYPT
1999
Springer
13 years 11 months ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...