Sciweavers

234 search results - page 16 / 47
» Rademacher Margin Complexity
Sort
View
AAMAS
2004
Springer
13 years 7 months ago
Multi-Dimensional, MultiStep Negotiation
We present a multi-dimensional, multi-step negotiation mechanism for task allocation among cooperative agents based on distributed search. This mechanism uses marginal utility gai...
Xiaoqin Zhang, Victor R. Lesser, Rodion M. Podoroz...
NIPS
2001
13 years 8 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 7 months ago
On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack
As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Line...
Mohammad Reza Sohizadeh Abyaneh
NIPS
2001
13 years 8 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 4 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...