Sciweavers

922 search results - page 36 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
Capacity of General Discrete Noiseless Channels
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discre...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
DM
2008
114views more  DM 2008»
13 years 7 months ago
Subdivisions of graphs: A generalization of paths and cycles
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
Ch. Sobhan Babu, Ajit A. Diwan
FOCS
2006
IEEE
14 years 1 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 13 days ago
On a small gain theorem for networks of iISS systems
— This paper considers networks consisting of integral input-to-state stable (iISS) subsystems and addresses the problem of verifying iISS property of a given network. First, we ...
Hiroshi Ito, Sergey Dashkovskiy, Fabian Wirth
JCT
1998
99views more  JCT 1998»
13 years 7 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu