Sciweavers

1201 search results - page 136 / 241
» On the cardinality of fuzzy sets
Sort
View
178
Voted
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 7 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
184
Voted
ACIVS
2005
Springer
16 years 16 days ago
Image De-Quantizing via Enforcing Sparseness in Overcomplete Representations
We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete or...
Luis Mancera, Javier Portilla
VLDB
2005
ACM
86views Database» more  VLDB 2005»
16 years 14 days ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
176
Voted
DIAGRAMS
2000
Springer
15 years 11 months ago
On the Completeness and Expressiveness of Spider Diagram Systems
Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations ...
John Howse, Fernando Molina, John Taylor
CPAIOR
2006
Springer
15 years 10 months ago
Open Constraints in a Closed World
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
Willem Jan van Hoeve, Jean-Charles Régin