Sciweavers

812 search results - page 49 / 163
» corr 2007
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 10 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 9 months ago
Network synchronizability analysis: the theory of subgraphs and complementary graphs
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
Zhisheng Duan, Chao Liu, Guanrong Chen
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 10 months ago
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
Roman Vershynin
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 10 months ago
A Sequent Calculus for Modelling Interferences
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in pro...
Christophe Fouqueré
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 10 months ago
Using Description Logics for Recognising Textual Entailment
The aim of this paper is to show how we can handle the Recognising Textual Entailment (RTE) task by using Description Logics (DLs). To do this, we propose a representation of natur...
Paul Bedaride