Sciweavers

3656 search results - page 32 / 732
» Compact Location Problems
Sort
View
KDD
1997
ACM
109views Data Mining» more  KDD 1997»
14 years 2 months ago
Selecting Features by Vertical Compactness of Data
Feature selection is a data preprocessing step for classi cation and data mining tasks. Traditionally, feature selection is done by selecting a minimum number of features that det...
Ke Wang, Suman Sundaresh
DFT
2004
IEEE
94views VLSI» more  DFT 2004»
14 years 1 months ago
Response Compaction for Test Time and Test Pins Reduction Based on Advanced Convolutional Codes
This paper addresses the problem of test response compaction. In order to maximize compaction ratio, a single-output encoder based on check matrix of a (n, n1, m, 3) convolutional...
Yinhe Han, Yu Hu, Huawei Li, Xiaowei Li, Anshuman ...
DEXA
2006
Springer
80views Database» more  DEXA 2006»
14 years 1 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
MICCAI
2003
Springer
14 years 10 months ago
Establishing Local Correspondences towards Compact Representations of Anatomical Structures
Computer-aided diagnosis is often based on comparing a structure of interest with prior models. Such a comparison requires automatic techniques in determining prior models from a s...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
14 years 6 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...