697 search results - page 61 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
268
click to vote
IJCV
2006
15 years 5 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
143
click to vote
ECRTS
2007
IEEE
15 years 11 months ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
171
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
148
Voted
CLUSTER
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
135
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...