Sciweavers

1029 search results - page 26 / 206
» Compact representations of ordered sets
Sort
View
ASPDAC
2006
ACM
144views Hardware» more  ASPDAC 2006»
15 years 8 months ago
Compaction of pass/fail-based diagnostic test vectors for combinational and sequential circuits
Abstract— Substantial attention is being paid to the fault diagnosis problem in recent test literature. Yet, the compaction of test vectors for fault diagnosis is little explored...
Yoshinobu Higami, Kewal K. Saluja, Hiroshi Takahas...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 10 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
159
Voted
DCC
2011
IEEE
14 years 9 months ago
Color Image Compression Using a Learned Dictionary of Pairs of Orthonormal Bases
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...
Xin Hou, Karthik S. Gurumoorthy, Ajit Rajwade
127
Voted
ICPR
2006
IEEE
16 years 3 months ago
Hybrid Kernel Machine Ensemble for Imbalanced Data Sets
A two-class imbalanced data problem (IDP) emerges when the data from majority class are compactly clustered and the data from minority class are scattered. Though a discriminative...
Kap Luk Chan, Peng Li, Wen Fang
111
Voted
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
15 years 9 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an eï¬...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld