2131 search results - page 36 / 427 » Immunity for Closed Sets |
RSCTC
2000
Springer
14 years 2 months ago
2000
Springer
The aim of the paper is to present basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similari...
APPML
2010
13 years 11 months ago
2010
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
ALGORITHMICA
2006
13 years 11 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
SIGMOD
2002
ACM
14 years 11 months ago
2002
ACM
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
DM
2007
13 years 11 months ago
2007
We construct families of three-dimensional linear codes that attain the Griesmer bound and give a probablistic construction of linear codes that are close to the Griesmer bound. Al...