A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...
Dragomir Anguelov, Benjamin Taskar, Vassil Chatalb...
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...