1633 search results - page 268 / 327 » Planar Map Graphs |
TC
1998
13 years 9 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
JCSS
2011
13 years 5 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
TKDE
2011
13 years 5 months ago
2011
—Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization base...
PAMI
2010
13 years 4 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...