Sciweavers

7840 search results - page 135 / 1568
» On generalized Ramsey numbers
Sort
View
DAGM
1995
Springer
14 years 2 months ago
Primary Image Segmentation
: This paper introduces the notion of primary image segmentation which serves as a well defined link between low- and high-level image analysis. A general algorithmic framework bas...
Ullrich Köthe
DAM
2002
78views more  DAM 2002»
13 years 10 months ago
Uniquely 2-list colorable graphs
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
ENDM
2002
107views more  ENDM 2002»
13 years 10 months ago
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
Tao Jiang, Douglas B. West
DM
1998
82views more  DM 1998»
13 years 10 months ago
Signed analogs of bipartite graphs
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
Thomas Zaslavsky
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 10 months ago
Choosing Multiple Parameters for Support Vector Machines
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
Olivier Chapelle, Vladimir Vapnik, Olivier Bousque...