Sciweavers

113 search results - page 13 / 23
» Obnoxious Centers in Graphs
Sort
View
EMMCVPR
2009
Springer
14 years 1 months ago
Robust Segmentation by Cutting across a Stack of Gamma Transformed Images
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Medical image segmentation appears to be ...
Elena Bernardis, Stella X. Yu
ICMCS
2007
IEEE
107views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Finding Image Structure by Hierarchal Segmentation
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
Bo Qiu, Daniel Racoceanu
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 22 days ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
DOLAP
2000
ACM
13 years 11 months ago
Automatically Generating OLAP Schemata from Conceptual Graphical Models
Generating tool specific schemata and configuration information for OLAP database tools from conceptual graphical models is an important prerequisite for a comprehensive tool supp...
Karl Hahn, Carsten Sapia, Markus Blaschka
JGT
2007
85views more  JGT 2007»
13 years 6 months ago
On graphs with subgraphs having large independence numbers
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
Noga Alon, Benny Sudakov