14829 search results - page 10 / 2966 » How Many Different |
CIKM
1997
Springer
15 years 6 months ago
1997
Springer
106
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
DAGSTUHL
2003
15 years 3 months ago
2003
107
click to vote
COMCOM
2006
15 years 2 months ago
2006
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
JGT
2006
15 years 2 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...