Sciweavers

160 search results - page 29 / 32
» Highly Scalable Rough Set Reducts Generation
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
CIKM
2006
Springer
14 years 25 days ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
13 years 8 months ago
Mitigation of intra-array SRAM variability using adaptive voltage architecture
SRAM cell design is driven by the need to satisfy static noise margin, write margin and read current margin (RCM) over all cells in the array in an energy-efficient manner. These ...
Ashish Kumar Singh, Ku He, Constantine Caramanis, ...
CIVR
2007
Springer
195views Image Analysis» more  CIVR 2007»
14 years 5 months ago
Towards optimal bag-of-features for object categorization and semantic video retrieval
Bag-of-features (BoF) deriving from local keypoints has recently appeared promising for object and scene classification. Whether BoF can naturally survive the challenges such as ...
Yu-Gang Jiang, Chong-Wah Ngo, Jun Yang 0003
DAC
2005
ACM
14 years 11 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim