5889 search results - page 350 / 1178 » Graph Layout Problems |
180
Voted
ICPP
2005
IEEE
16 years 11 days ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
170
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
190
click to vote
FOCM
2007
15 years 6 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
285
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
200
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
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...