2746 search results - page 30 / 550 » Bisubmodular Function Minimization |
154
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
105
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Testing and debugging database software is often challenging and time consuming. A very arduous task for DB testers is finding a min-repro ? the "simplest possible setup"...
123
click to vote
IH
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
100
click to vote
ISCAS
2003
IEEE
15 years 7 months ago
2003
IEEE
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...