692 search results - page 43 / 139 » Why Experimentation can be better than |
250
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Data cleaning based on similarities involves identification of "close" tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the do...
145
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper integrates Markov random fields (MRFs) with type-2 fuzzy sets (T2 FSs) referred to as T2 FMRFs, which can handle the fuzziness of the labeling space as well as the rand...
132
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
179
click to vote
DCC
2009
IEEE
16 years 29 days ago
2009
IEEE
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
172
click to vote
CEC
2008
IEEE
16 years 19 days ago
2008
IEEE
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...