2356 search results - page 34 / 472 » Characterizations of postman sets |
103
click to vote
DM
2006
15 years 1 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...
103
Voted
AUTOMATICA
2002
15 years 1 months ago
2002
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
110
click to vote
DM
1999
15 years 1 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
219
Voted
ICIP
2010
IEEE
14 years 11 months ago
2010
IEEE
Signal degradation impacts the final quality of images acquired using remote sensing radiometer. The effectiveness of a restoration algorithm strongly depends on two main factors:...
155
Voted
CONCUR
2011
Springer
14 years 1 months ago
2011
Springer
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...