Sciweavers

1532 search results - page 5 / 307
» Connection Relations in Mereotopology
Sort
View
JCT
2008
84views more  JCT 2008»
13 years 5 months ago
Wild triangles in 3-connected matroids
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
James G. Oxley, Charles Semple, Geoff Whittle
PPOPP
2012
ACM
12 years 2 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
LOGCOM
2002
105views more  LOGCOM 2002»
13 years 7 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
JOCN
2011
78views more  JOCN 2011»
13 years 2 months ago
Changes in Cerebello-motor Connectivity during Procedural Learning by Actual Execution and Observation
■ The cerebellum is involved in motor learning of new procedures both during actual execution of a motor task and during observational training. These processes are thought to d...
Sara Torriero, Massimiliano Oliveri, Giacomo Koch,...
DAM
2002
120views more  DAM 2002»
13 years 7 months ago
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
Daniela Ferrero, Carles Padró