7123 search results - page 34 / 1425 » The Ordered Set of Rough Sets |
APPML
2010
13 years 10 months ago
2010
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
ICCI
1993
14 years 1 months ago
1993
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
ORDER
2006
13 years 9 months ago
2006
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Level set method based segmentation provides an efficient tool for topological and geometrical shape handling. Conventional level set surfaces are only C0 continuous since the le...