3 citations · 3 across the 3 of their papers we have counts for
4 papers
Minimum blockers and extremal graphs for nonnested matchings
Pedro M. M. de Castro
We classify all smallest sets of edge deletions that destroy every nonnested perfect matching in a complete ordered graph. The vertices have a fixed linear order. A perfect matchin…
Optimal exponential memory for sequential Euclidean connections: edge-power costs and phase transitions
Pedro M. M. de Castro
We study the edge-power cost of the labelled tree generated by the -strategy, a constant-gain rule for sequential Euclidean connections. Starting with , each input poin…
Sequential Euclidean connections with exponential memory: distributional performance and adversarial robustness
Pedro M. M. de Castro
Points in the unit ball of are processed sequentially. Each new point is connected to a state that summarizes earlier observations, after which $x_i=γ…
Intersection of paraboloids and application to Minkowski-type problems
Pedro Machado Manhães De Castro, Quentin Mérigot, Boris Thibert
In this article, we study the intersection (or union) of the convex hull of N confocal paraboloids (or ellipsoids) of revolution. This study is motivated by a Minkowski-type proble…