1736 search results - page 48 / 348 » The rank-width of Directed Graphs |
157
Voted
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
139
Voted
JPDC
2007
15 years 3 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
146
Voted
UAI
2008
15 years 5 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
139
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
132
click to vote
ARSCOM
2004
15 years 3 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...