Sciweavers

Share
SIAMDM
2010
109views more  SIAMDM 2010»
9 years 6 months ago
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
Maya Stein
JSYML
2010
95views more  JSYML 2010»
9 years 6 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
JUCS
2010
124views more  JUCS 2010»
9 years 10 months ago
Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
André Trudel
MCSS
2008
Springer
9 years 11 months ago
Maximal solution to algebraic Riccati equations linked to infinite Markov jump linear systems
In this paper we deal with a perturbed algebraic Riccati equation in an infinite dimensional Banach space. Besides the interest in its own right, this class of equations appears, ...
Jack Baczynski, Marcelo D. Fragoso
ML
2002
ACM
127views Machine Learning» more  ML 2002»
9 years 11 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
COMBINATORICA
2004
119views more  COMBINATORICA 2004»
9 years 11 months ago
On Infinite Cycles II
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
Reinhard Diestel, Daniela Kühn
COMBINATORICA
2004
127views more  COMBINATORICA 2004»
9 years 11 months ago
On Infinite Cycles I
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
Reinhard Diestel, Daniela Kühn
NETWORKS
2006
9 years 11 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
INFORMATICALT
2008
123views more  INFORMATICALT 2008»
9 years 12 months ago
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities
Abstract. A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part i...
Yaroslav D. Sergeyev
CPC
2006
132views more  CPC 2006»
9 years 12 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
books