2652 search results - page 267 / 531 » Privacy-preserving linear programming |
160
Voted
CPAIOR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
137
Voted
JMLR
2012
13 years 6 months ago
2012
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...
141
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
137
Voted
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
172
Voted
SAS
1994
Springer
15 years 7 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...