Sciweavers

112 search results - page 16 / 23
» An edge colouring of multigraphs
Sort
View
CAIP
1995
Springer
189views Image Analysis» more  CAIP 1995»
14 years 1 months ago
Spatial and Feature Space Clustering: Applications in Image Analysis
We propose a novel approach to image segmentation, called feature and spatial domain clustering. The method is devised to group pixel data by taking into account simultaneously bo...
Jiri Matas, Josef Kittler
LICS
2010
IEEE
13 years 8 months ago
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
Martin Otto
ICDAR
2009
IEEE
13 years 7 months ago
Robust Extraction of Text from Camera Images
Text within a camera grabbed image can contain a huge amount of meta data about that scene. Such meta data can be useful for identification, indexing and retrieval purposes. Detec...
Shyama Prosad Chowdhury, Soumyadeep Dhar, Amit Kum...
ESA
2004
Springer
125views Algorithms» more  ESA 2004»
14 years 3 months ago
Approximation Algorithms for Quickest Spanning Tree Problems
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
Refael Hassin, Asaf Levin
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
14 years 2 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...