11949 search results - page 243 / 2390 » Some results on (a:b)-choosability |
144
click to vote
GC
2010
Springer
15 years 3 days ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
HAID
2010
Springer
15 years 3 days ago
2010
Springer
One factor which can be expected to influence performance in applications where the user points a device in some direction to obtain information is the angle interval in which the ...
166
click to vote
MEDBIOMETRICS
2010
15 years 2 hour ago
2010
This study proposes an effective method called DIAMOND to classify biological and medical data. Given a set of objects with some classes, DIAMOND separates the objects into differe...
137
click to vote
MP
2010
14 years 12 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
PR
2010
14 years 12 months ago
2010
This paper presents a classification approach, where a sample is represented by a set of feature vectors called an attributed point pattern. Some attributes of a point are transf...