4781 search results - page 778 / 957 » Complexity at large |
COMSUR
2011
12 years 10 months ago
2011
—In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such rout...
ICCV
2007
IEEE
15 years 10 days ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
ECCV
2004
Springer
15 years 8 days ago
2004
Springer
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
ECCV
2006
Springer
15 years 8 days ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
ICIP
2005
IEEE
15 years 1 days ago
2005
IEEE
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...