2801 search results - page 12 / 561 » On the Adequateness of the Connection Method |
IJCAI
2007
13 years 9 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a rotation-invariant multi-scale morphological method for texture analysis, which compared with existing methods has three advantages: (i) it can be implemented efficie...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Admission control algorithms used in access networks for multiplexed voice sources are typically based on aggregated system characteristics, such as aggregate loss prob...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generat...
FMCAD
2000
Springer
13 years 11 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...