5275 search results - page 866 / 1055 » Computing by observing |
143
click to vote
IACR
2011
14 years 3 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
158
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
131
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
140
click to vote
RAID
1999
Springer
15 years 8 months ago
1999
Springer
: I will discuss two efforts to get Intrusion Detection Systems to work together - the Common Intrusion Detection Framework (CIDF), and the IETF's working group to develop an ...
135
click to vote
TEC
2002
15 years 3 months ago
2002
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...