Sciweavers

2356 search results - page 50 / 472
» Characterizations of postman sets
Sort
View
WAW
2004
Springer
80views Algorithms» more  WAW 2004»
15 years 5 months ago
Dominating Sets in Web Graphs
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
Colin Cooper, Ralf Klasing, Michele Zito
ISIPTA
1999
IEEE
15 years 4 months ago
Nonlinear Filtering of Convex Sets of Probability Distributions
A solution is provided to the problem of computing a convex set of conditional probability distributions that characterize the state of a nonlinear dynamic system as it evolves in...
John Kenney, Wynn C. Stirling
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
14 years 12 months ago
Exact determinations of the maximal output admissible set for a class of nonlinear systems
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
Kenji Hirata, Yoshito Ohta
JSYML
2010
71views more  JSYML 2010»
14 years 10 months ago
Limitwise monotonic functions, sets, and degrees on computable domains
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
Asher M. Kach, Daniel Turetsky
IJAR
2008
82views more  IJAR 2008»
14 years 12 months ago
Probabilistic rough set approximations
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
Yiyu Yao