4903 search results - page 590 / 981 » The Set Covering Machine |
228
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
196
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
193
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
158
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
187
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...