2365 search results - page 144 / 473 » All things are connected |
200
click to vote
DM
2002
15 years 6 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
179
click to vote
CAGD
1999
15 years 6 months ago
1999
We investigate surfaces which interpolate given boundary curves. We show that the discrete bilinearly blended Coons patch can be defined as the solution of a linear system. With t...
186
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we introduce an on-line Arabic handwritten recognition system based on new stroke segmentation algorithm. The proposed algorithm uses an over segmentation method th...
195
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider large scale interconnected systems where some of the interconnections are characterized by uncertain bounded delays. The delays may for instance be due to a communicati...
272
click to vote
MLQ
2011
15 years 1 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...