Sciweavers

925 search results - page 64 / 185
» Connectivity on Complete Lattices
Sort
View
MSCS
2007
125views more  MSCS 2007»
14 years 11 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym
BC
2005
106views more  BC 2005»
14 years 11 months ago
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Abstract We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phas...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...
JCT
2007
122views more  JCT 2007»
14 years 11 months ago
h-Vectors of Gorenstein polytopes
We show that the Ehrhart h-vector of an integer Gorenstein polytope with a unimodular triangulation satisfies McMullen’s g-theorem; in particular it is unimodal. This result gen...
Winfried Bruns, Tim Römer
DAM
1999
128views more  DAM 1999»
14 years 11 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
ICASSP
2011
IEEE
14 years 3 months ago
Downsampling graphs using spectral theory
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
Sunil K. Narang, Antonio Ortega