Sciweavers

5344 search results - page 89 / 1069
» Privacy-Preserving Set Operations
Sort
View
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 3 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
ICCAD
2002
IEEE
152views Hardware» more  ICCAD 2002»
14 years 7 months ago
Efficient instruction encoding for automatic instruction set design of configurable ASIPs
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
Jong-eun Lee, Kiyoung Choi, Nikil Dutt
ICCV
2003
IEEE
14 years 3 months ago
Unsupervised Non-parametric Region Segmentation Using Level Sets
We present a novel non-parametric unsupervised segmentation algorithm based on Region Competition [21]; but implemented within a Level Sets framework [11]. The key novelty of the ...
Timor Kadir, Michael Brady
VLDB
2009
ACM
159views Database» more  VLDB 2009»
14 years 10 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
RSKT
2010
Springer
13 years 8 months ago
Ordered Weighted Average Based Fuzzy Rough Sets
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...
Chris Cornelis, Nele Verbiest, Richard Jensen