Sciweavers

1149 search results - page 59 / 230
» Minimally non-Pfaffian graphs
Sort
View
JMLR
2008
141views more  JMLR 2008»
14 years 11 months ago
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
Mathias Drton, Thomas S. Richardson
ASYNC
2001
IEEE
136views Hardware» more  ASYNC 2001»
15 years 3 months ago
Efficient Exact Two-Level Hazard-Free Logic Minimization
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
Chris J. Myers, Hans M. Jacobson
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 1 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
ISVC
2009
Springer
15 years 4 months ago
A Novel 3D Segmentation of Vertebral Bones from Volumetric CT Images Using Graph Cuts
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...
Melih S. Aslan, Asem M. Ali, Ham M. Rara, Ben Arno...
ICIP
2010
IEEE
14 years 9 months ago
Image partitioning with kernel mapping and graph cuts
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed