1578 search results - page 220 / 316 » Direct Routing: Algorithms and Complexity |
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
CVPR
2007
IEEE
15 years 2 days ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
ICIP
2004
IEEE
14 years 11 months ago
2004
IEEE
We present a novel approach for highway traffic event detection. Our algorithm extracts features directly from the compressed video and automatically detects traffic events using ...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Band ratios have many useful applications in hyperspectral image analysis. While optimal ratios have been chosen empirically in previous research, we propose a principled algorith...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
In this paper we propose a compressed-domain image enhancement algorithm based on color appearance modeling. We aim at providing an efficient high-quality JPEG color image enhancem...