Sciweavers

1274 search results - page 146 / 255
» Graph lambda theories
Sort
View
DM
2008
82views more  DM 2008»
13 years 9 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 9 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
IJBC
2007
54views more  IJBC 2007»
13 years 9 months ago
Impact Dynamics of Large Dimensional Systems
In this paper we present a model of impact dynamics in large dimensional systems. We describe a hybrid method, based on graph theory and probability theory, which enables us quali...
Martin E. Homer, S. John Hogan
JODS
2007
102views Data Mining» more  JODS 2007»
13 years 9 months ago
Default Clustering with Conceptual Structures
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
Julien Velcin, Jean-Gabriel Ganascia
NETWORKS
2010
13 years 7 months ago
Optical index of fault tolerant routings in WDM networks
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Stéphane Bessy, Clément Lepelletier