87 search results - page 6 / 18 » Roughness bounds in rough set operations |
ESA
2010
Springer
14 years 10 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
109
click to vote
TKDE
2011
14 years 4 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
106
click to vote
CIE
2009
Springer
15 years 1 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
IJAR
2010
14 years 8 months ago
2010
Granular Computing is an emerging conceptual and computing paradigm of information processing. A central notion is an information-processing pyramid with different levels of clari...
55
Voted
MOC
2002
14 years 9 months ago
2002
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...