Sciweavers

199 search results - page 29 / 40
» Connectivity of addable graph classes
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
JCP
2008
162views more  JCP 2008»
13 years 7 months ago
Shape Recognition by Clustering and Matching of Skeletons
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
Hamidreza Zaboli, Mohammad Rahmati, Abdolreza Mirz...
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
ICDT
2005
ACM
125views Database» more  ICDT 2005»
14 years 1 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu