Sciweavers

2746 search results - page 84 / 550
» Bisubmodular Function Minimization
Sort
View
KDD
2002
ACM
119views Data Mining» more  KDD 2002»
16 years 3 months ago
Evaluating classifiers' performance in a constrained environment
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
Anna Olecka
ASIACRYPT
2005
Springer
15 years 9 months ago
Revealing Additional Information in Two-Party Computations
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
Andreas Jakoby, Maciej Liskiewicz
EOR
2008
90views more  EOR 2008»
15 years 3 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CVPR
1997
IEEE
15 years 7 months ago
Area and Length Minimizing Flows for Shape Segmentation
— A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. Th...
Kaleem Siddiqi, Steven W. Zucker, Yves Béru...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 4 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...