2746 search results - page 43 / 550 » Bisubmodular Function Minimization |
117
click to vote
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
DSD
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper shows a method to reduce the number of input variables to represent incompletely specified index generation functions. A compound variable is generated by EXORing the o...
134
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
103
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
117
click to vote
NIPS
2007
15 years 3 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....