1734 search results - page 79 / 347 » its 2000 |
DM
2000
14 years 9 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
ENDM
2000
14 years 9 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
ENDM
2000
14 years 9 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
IJCV
2000
14 years 9 months ago
2000
We propose a method for detecting geometric structures in an image, without any a priori information. Roughly speaking, we say that an observed geometric event is "meaningful&...
IJUFKS
2000
14 years 9 months ago
2000
The concept of entropy of a discrete fuzzy measure has been recently introduced in two different ways. A first definition was proposed by Marichal [10] in the aggregation framewor...