5100 search results - page 362 / 1020 » The Linear Complexity of a Graph |
156
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
146
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
191
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
174
click to vote
TAGT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Management of development processes in di erent engineering disciplines is a challenging task. We present an integrated approach which covers not only the activities to b...
175
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...