76 search results - page 4 / 16 » Asking Questions to Minimize Errors |
ML
2000
ACM
13 years 7 months ago
2000
ACM
Bagging and boosting reduce error by changing both the inputs and outputs to form perturbed training sets, grow predictors on these perturbed training sets and combine them. A que...
FOCS
1996
IEEE
13 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
PVLDB
2010
13 years 5 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
AUTOMATICA
2006
13 years 7 months ago
2006
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...