Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
—Inspired by Weber’s Law, this paper proposes a simple, yet very powerful and robust local descriptor, called the Weber Local Descriptor (WLD). It is based on the fact that hum...
Jie Chen, Shiguang Shan, Chu He, Guoying Zhao, Mat...
Automated, rapid, and effective fault management is a central goal of large operational IP networks. Today's networks suffer from a wide and volatile set of failure modes, wh...
Ramana Rao Kompella, Jennifer Yates, Albert G. Gre...
In this paper we present a method for learning a curve model for detection and segmentation by closely integrating a hierarchical curve representation using generative and discrim...
Adrian Barbu, Vassilis Athitsos, Bogdan Georgescu,...