1615 search results - page 221 / 323 » Computer science and decision theory |
173
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
245
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
172
click to vote
IMCS
2007
15 years 6 months ago
2007
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
211
click to vote
CCS
2005
ACM
16 years 11 days ago
2005
ACM
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
160
click to vote
CSCW
2010
ACM
16 years 3 months ago
2010
ACM
Managing one’s availability for interaction with others is an increasingly complex act, involving multiple media and the sharing of many types of information. In this paper we d...