Sciweavers

569 search results - page 44 / 114
» An efficient clustering method for k-anonymization
Sort
View
ASPDAC
1999
ACM
113views Hardware» more  ASPDAC 1999»
14 years 1 months ago
An Efficient Iterative Improvement Technique for VLSI Circuit Partitioning Using Hybrid Bucket Structures
In this paper, we present a fast and efficient Iterative Improvement Partitioning (IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. Due to thei...
C. K. Eem, J. W. Chong
BMCBI
2010
193views more  BMCBI 2010»
13 years 3 months ago
Mayday - integrative analytics for expression data
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...
Florian Battke, Stephan Symons, Kay Nieselt
IPPS
2009
IEEE
14 years 3 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
ACL
1997
13 years 10 months ago
Document Classification Using a Finite Mixture Model
We propose a new method of classifying documents into categories. We define for each category a finite mixture model based on soft clustering of words. We treat the problem of cla...
Hang Li, Kenji Yamanishi
CVPR
2007
IEEE
14 years 10 months ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid