Sciweavers

1420 search results - page 124 / 284
» Representation of Graphs by OBDDs
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 6 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ICCV
2011
IEEE
14 years 6 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...
SEMWEB
2009
Springer
16 years 1 months ago
Node-Link and Containment Methods in Ontology Visualization
OWL Ontology language can be very expressive. This could provide difficulty in ontology understanding process. We belief, that an ontology visualization equipped with intuitive int...
Julia Dmitrieva, Fons J. Verbeek
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
16 years 1 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
WWW
2011
ACM
15 years 1 months ago
OntoTrix: a hybrid visualization for populated ontologies
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
Benjamin Bach, Emmanuel Pietriga, Ilaria Liccardi,...