4781 search results - page 778 / 957 » Complexity at large |
135
Voted
COMSUR
2011
14 years 3 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...
126
click to vote
ICCV
2007
IEEE
16 years 5 months 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 ...
143
Voted
ECCV
2004
Springer
16 years 5 months 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 ...
131
click to vote
ECCV
2006
Springer
16 years 5 months 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-...
225
Voted
ICIP
2005
IEEE
16 years 5 months 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...