446 search results - page 51 / 90 » A fast algorithm for computing steiner edge connectivity |
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
PR
2008
13 years 6 months ago
2008
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...