Results 51 to 60 of about 2,899,550 (97)
KOALA GRAPH THEORY INTERNET SERVICE
TASK Quarterly, 2015 KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discrete optimization.
TOMASZ GOLUCH +2 more
doaj +1 more source
On minimal blocking sets of the generalized quadrangle $Q(4, q)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The generalized quadrangle $Q(4,q)$ arising from the parabolic quadric in $PG(4,q)$ always has an ovoid. It is not known whether a minimal blocking set of size smaller than $q^2 + q$ (which is not an ovoid) exists in $Q(4,q)$, $q$ odd. We present results
Miroslava Cimráková, Veerle Fack
doaj +1 more source
Information, 2023 Integrating physical simulation data into data ecosystems challenges the compatibility and interoperability of data management tools. Semantic web technologies and relational databases mostly use other data types, such as measurement or manufacturing ...
Philipp Spelten +4 more
doaj +1 more source
Unconfused Ultraconservative Multiclass Algorithms [PDF]
, 2013 We tackle the problem of learning linear classifiers from noisy datasets in a multiclass setting. The two-class version of this problem was studied a few years ago by, e.g. Bylander (1994) and Blum et al.
Louche, Ugo, Ralaivola, Liva
core +5 more sources
Progress in lattice algorithms [PDF]
, 2002 The development of Monte Carlo algorithms for generating gauge field configurations with dynamical fermions and methods for extracting the most information from ensembles are summarised.Comment: Lattice2001(plenary) 9 pages, 4 figures.
Peardon, Mike
core +3 more sources
Packing Three-Vertex Paths in a Subcubic Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In our paper we consider the $P_3$-packing problem in subcubic graphs of different connectivity, improving earlier results of Kelmans and Mubayi. We show that there exists a $P_3$-packing of at least $\lceil 3n/4\rceil$ vertices in any connected subcubic
Adrian Kosowski +2 more
doaj +1 more source
Algorithms for entanglement renormalization [PDF]
, 2009 We describe an iterative method to optimize the multi-scale entanglement renormalization ansatz (MERA) for the low-energy subspace of local Hamiltonians on a D-dimensional lattice.
G. Evenbly +4 more
core +2 more sources
, 2012 Consider the problem when we want to construct some structure on a bounded degree graph, e.g. an almost maximum matching, and we want to decide about each edge depending only on its constant radius neighbourhood.
Csóka, Endre
core
Combinatorial optimization in networks with Shared Risk Link Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the ...
David Coudert +3 more
doaj +1 more source
Order statistics and estimating cardinalities of massive data sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We introduce a new class of algorithms to estimate the cardinality of very large multisets using constant memory and doing only one pass on the data. It is based on order statistics rather that on bit patterns in binary representations of numbers.
Frédéric Giroire
doaj +1 more source