420 search results - page 8 / 84 » Some Algorithmic Problems in Polytope Theory |
80
Voted
ICML
1999
IEEE
15 years 10 months ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
ASIAN
2006
Springer
15 years 1 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
CSC
2008
14 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
INFORMS
2008
14 years 9 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...