2432 search results - page 99 / 487 » Degrees and choice numbers |
144
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
164
click to vote
ESANN
2006
15 years 7 months ago
2006
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
153
click to vote
DIMACS
2001
15 years 7 months ago
2001
Let C be a smooth real plane curve. Let c be its degree and g its genus. We assume that C has at least g real branches. Let d be a nonzero natural integer strictly less than c. Let...
145
click to vote
EUSFLAT
2001
15 years 7 months ago
2001
Rule based systems for Fuzzy Control, Fuzzy Supervising and Fuzzy Diagnosis are non-linear multi-input, multi-output systems. The result of the signal processing within the system...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...