5056 search results - page 435 / 1012 » Network Coding Theory |
205
Voted
ESANN
2000
15 years 6 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
257
click to vote
Book
This is an introductory book about machine learning. Notice that this is a draft book. It may contain typos, mistakes, etc.
The book covers the following topics: Boolean Functio...
121
click to vote
ICDCSW
2008
IEEE
15 years 11 months ago
2008
IEEE
In this position paper we investigate the security of cyberphysical systems. We (1) identify and define the problem of secure control, (2) investigate the defenses that informati...
123
click to vote
IJCNN
2008
IEEE
15 years 11 months ago
2008
IEEE
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
117
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...