893 search results - page 126 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
ECCV
2000
Springer
14 years 1 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
CN
2008
13 years 9 months ago
2008
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
CP
2004
Springer
14 years 2 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...