We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer… (More)

The journal of maternal-fetal & neonatal medicine…

2015

OBJECTIVE
The aim of this study was to evaluate the birth outcomes of cases with four types of conotruncal defects (CTDs), i.e. common truncus, transposition of great arteries, tetralogy of Fallot… (More)

Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found in polynomial time… (More)

The push-sum algorithm allows distributed computing of the average on a directed graph, and is particularly relevant when one is restricted to one-way and/or asynchronous communications. We… (More)

The aim of our project was to study possible etiological factors in the origin of congenital heart defects (CHDs) because in the majority of patients the underlying causes are unclear. Cases with… (More)

A set of nonnegative matricesM = {M1,M2, . . . ,Mk} is called primitive if there exist indices i1, i2, . . . , im such that Mi1Mi2 . . .Mim is positive (i.e. has all its entries > 0). The length of… (More)

We consider Acyclic Unique Sink Orientations of the n-dimensional hyper-cube (AUSOs), that is, acyclic orientations of the edges of the hyper-cube such that any sub-cube has a unique vertex of… (More)