Sciweavers

4378 search results - page 166 / 876
» On the Complexity of Ordered Colourings
Sort
View
NIPS
2003
15 years 7 months ago
Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....
Thomas Natschläger, Wolfgang Maass
JGAA
2002
74views more  JGAA 2002»
15 years 6 months ago
Realization of Posets
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
Patrice Ossona de Mendez
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
16 years 23 days ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
CRV
2006
IEEE
114views Robotics» more  CRV 2006»
16 years 17 days ago
Generic Detection of Multi-Part Objects by High-Level Analysis
A method is proposed to detect multi-part man-made or natural objects in complex images. It consists in first extracting simple curves and straight lines from the edge map. Then,...
Jean-Francois Bernier, Robert Bergevin