Sciweavers

3396 search results - page 537 / 680
» Tree representations of graphs
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 4 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap
MVA
2008
15 years 4 months ago
Retrieving articulated 3-D models using medial surfaces
Abstract We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components an...
Kaleem Siddiqi, Juan Zhang, Diego Macrini, Ali Sho...
141
Voted
TOG
2008
107views more  TOG 2008»
15 years 4 months ago
Multiscale texture synthesis
Example-based texture synthesis algorithms have gained widespread popularity for their ability to take a single input image and create a perceptually similar non-periodic texture....
Charles Han, Eric Risser, Ravi Ramamoorthi, Eitan ...
143
Voted
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
15 years 4 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
TC
1998
15 years 4 months ago
Optimal Zero-Aliasing Space Compaction of Test Responses
—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 ...
Krishnendu Chakrabarty, Brian T. Murray, John P. H...