Sciweavers

697 search results - page 49 / 140
» Convex Functions on Discrete Sets
Sort
View
149
Voted
IPMU
2010
Springer
15 years 9 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
SIAMJO
2010
108views more  SIAMJO 2010»
15 years 4 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer
IJCAI
2003
15 years 7 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
170
Voted
IIWAS
2004
15 years 7 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
Fuw-Yi Yang, Jinn-ke Jan
DAGM
2005
Springer
15 years 11 months ago
Regularization on Discrete Spaces
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
Dengyong Zhou, Bernhard Schölkopf