Sciweavers

49 search results - page 7 / 10
» Approximation and Complexity of k-Splittable Flows
Sort
View
ICIP
2010
IEEE
14 years 7 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
85
Voted
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 9 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
15 years 1 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
77
Voted
INFOCOM
2000
IEEE
15 years 1 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
96
Voted
SCALESPACE
2005
Springer
15 years 3 months ago
Discontinuity-Preserving Computation of Variational Optic Flow in Real-Time
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
Andrés Bruhn, Joachim Weickert, Timo Kohlbe...