Sciweavers

205 search results - page 5 / 41
» Pruning 2-Connected Graphs
Sort
View
BMVC
2000
13 years 8 months ago
Region-Based Object Recognition: Pruning Multiple Representations and Hypotheses
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
Alireza Ahmadyfard, Josef Kittler
COMBINATORICS
2006
119views more  COMBINATORICS 2006»
13 years 7 months ago
Relaxations of Ore's Condition on Cycles
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
Ahmed Ainouche
DMTCS
2010
125views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Binary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
Stefan Felsner, Clemens Huemer, Sarah Kappes, Davi...
BMCBI
2008
96views more  BMCBI 2008»
13 years 7 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
SAC
2008
ACM
13 years 6 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee