Sciweavers

2128 search results - page 130 / 426
» A general characterization of indulgence
Sort
View
AML
2008
66views more  AML 2008»
15 years 4 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
15 years 4 months ago
Exact determinations of the maximal output admissible set for a class of nonlinear systems
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
Kenji Hirata, Yoshito Ohta
BMCBI
2008
114views more  BMCBI 2008»
15 years 4 months ago
The pairwise disconnectivity index as a new metric for the topological analysis of regulatory networks
Background: Currently, there is a gap between purely theoretical studies of the topology of large bioregulatory networks and the practical traditions and interests of experimental...
Anatolij Potapov, Björn Goemann, Edgar Wingen...
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
15 years 4 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 4 months ago
Approximate Capacity of Gaussian Relay Networks
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....