Sciweavers

2110 search results - page 263 / 422
» What is the complexity of a distributed computing system
Sort
View
126
Voted
SPAA
2010
ACM
15 years 9 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 4 months ago
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
Danny Bickson, Elad Yom-Tov, Danny Dolev
CCS
2008
ACM
15 years 6 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
CHI
2004
ACM
16 years 5 months ago
Affective sensors, privacy, and ethical contracts
Sensing affect raises critical privacy concerns, which are examined here using ethical theory, and with a study that illuminates the connection between ethical theory and privacy....
Carson Reynolds, Rosalind W. Picard
LAMAS
2005
Springer
15 years 10 months ago
An Overview of Cooperative and Competitive Multiagent Learning
Abstract Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the joint behaviors of agents with some degree of autonomy and the complexiti...
Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean ...