14386 search results - page 125 / 2878 » The Chinese Generals Problem |
123
click to vote
NIPS
2008
15 years 5 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
130
Voted
ACL
1992
15 years 4 months ago
1992
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
101
Voted
NETWORKS
2006
15 years 3 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
142
Voted
JAIR
2002
15 years 3 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
127
Voted
JUCS
2010
14 years 10 months ago
2010
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...