Sciweavers

2181 search results - page 164 / 437
» The restriction scaffold problem
Sort
View
104
Voted
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 1 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
190
Voted
ICDT
2009
ACM
143views Database» more  ICDT 2009»
16 years 1 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
117
Voted
COLOGNETWENTE
2008
15 years 2 months ago
Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
Céline Engelbeen, Samuel Fiorini
CVPR
2009
IEEE
16 years 8 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
107
Voted
ICML
1998
IEEE
16 years 1 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...