Sciweavers

1972 search results - page 71 / 395
» connection 2008
Sort
View
DM
2008
69views more  DM 2008»
13 years 9 months ago
Connectedness of the graph of vertex-colourings
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
ISBI
2008
IEEE
14 years 10 months ago
Connectivity-based parcellation of the cortical surface using q-ball imaging
This work exploits the idea that each individual brain region has a specific connection profile to create parcellations of the cortical surface using MR diffusion imaging. The par...
Cyril Poupon, Denis Rivière, Jean-Francois ...
TON
1998
80views more  TON 1998»
13 years 9 months ago
Blocking and nonblocking multirate Clos switching networks
— This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applica...
Soung C. Liew, Ming-Hung Ng, Cathy W. Chan
IPCO
2010
184views Optimization» more  IPCO 2010»
13 years 11 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
CORR
2008
Springer
61views Education» more  CORR 2008»
13 years 10 months ago
Short proofs of strong normalization
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
Aleksander Wojdyga