Page 1 Next

Displaying 1 – 20 of 4914

Showing per page

3 x + 1 minus the + .

Monks, Kenneth G. (2002)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

4D Embryogenesis image analysis using PDE methods of image processing

Paul Bourgine, Róbert Čunderlík, Olga Drblíková-Stašová, Karol Mikula, Mariana Remešíková, Nadine Peyriéras, Barbara Rizzi, Alessandro Sarti (2010)

Kybernetika

In this paper, we introduce a set of methods for processing and analyzing long time series of 3D images representing embryo evolution. The images are obtained by in vivo scanning using a confocal microscope where one of the channels represents the cell nuclei and the other one the cell membranes. Our image processing chain consists of three steps: image filtering, object counting (center detection) and segmentation. The corresponding methods are based on numerical solution of nonlinear PDEs, namely...

5-abelian cubes are avoidable on binary alphabets

Robert Mercaş, Aleksi Saarela (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A k-abelian cube is a word uvw, where the factors u, v, and w are either pairwise equal, or have the same multiplicities for every one of their factors of length at most k. Previously it has been shown that k-abelian cubes are avoidable over a binary alphabet for k ≥ 8. Here it is proved that this holds for k ≥ 5.

A backward selection procedure for approximating a discrete probability distribution by decomposable models

Francesco M. Malvestuto (2012)

Kybernetika

Decomposable (probabilistic) models are log-linear models generated by acyclic hypergraphs, and a number of nice properties enjoyed by them are known. In many applications the following selection problem naturally arises: given a probability distribution p over a finite set V of n discrete variables and a positive integer k , find a decomposable model with tree-width k that best fits p . If is the generating hypergraph of a decomposable model and p is the estimate of p under the model, we can measure...

A belief revision approach for argumentation-based negotiation agents

Pablo Pilotti, Ana Casali, Carlos Chesñevar (2015)

International Journal of Applied Mathematics and Computer Science

Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because they do not have some resources they need or they do not know how to use them to reach their goals. Therefore, they must start a negotiation dialogue, taking also into account that they might have incomplete or wrong beliefs about the other agent's...

A Bimodality Test in High Dimensions

Palejev, Dean (2012)

Serdica Journal of Computing

We present a test for identifying clusters in high dimensional data based on the k-means algorithm when the null hypothesis is spherical normal. We show that projection techniques used for evaluating validity of clusters may be misleading for such data. In particular, we demonstrate that increasingly well-separated clusters are identified as the dimensionality increases, when no such clusters exist. Furthermore, in a case of true bimodality, increasing the dimensionality makes identifying the correct...

A biologically inspired approach to feasible gait learning for a hexapod robot

Dominik Belter, Piotr Skrzypczyński (2010)

International Journal of Applied Mathematics and Computer Science

The objective of this paper is to develop feasible gait patterns that could be used to control a real hexapod walking robot. These gaits should enable the fastest movement that is possible with the given robot's mechanics and drives on a flat terrain. Biological inspirations are commonly used in the design of walking robots and their control algorithms. However, legged robots differ significantly from their biological counterparts. Hence we believe that gait patterns should be learned using the...

A blind definition of shape

J. L. Lisani, J. M. Morel, L. Rudin (2002)

ESAIM: Control, Optimisation and Calculus of Variations

In this note, we propose a general definition of shape which is both compatible with the one proposed in phenomenology (gestaltism) and with a computer vision implementation. We reverse the usual order in Computer Vision. We do not define “shape recognition” as a task which requires a “model” pattern which is searched in all images of a certain kind. We give instead a “blind” definition of shapes relying only on invariance and repetition arguments. Given a set of images , we call shape of this...

A blind definition of shape

J. L. Lisani, J. M. Morel, L. Rudin (2010)

ESAIM: Control, Optimisation and Calculus of Variations

In this note, we propose a general definition of shape which is both compatible with the one proposed in phenomenology (gestaltism) and with a computer vision implementation. We reverse the usual order in Computer Vision. We do not define “shape recognition" as a task which requires a “model" pattern which is searched in all images of a certain kind. We give instead a “blind" definition of shapes relying only on invariance and repetition arguments. Given a set of images , we call shape of this...

A branch-and-cut algorithm for a resource-constrained scheduling problem

Renaud Sirdey, Hervé L. M. Kerivin (2007)

RAIRO - Operations Research

This paper is devoted to the exact resolution of a strongly NP-hard resource-constrained scheduling problem, the Process Move Programming problem, which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance,...

Currently displaying 1 – 20 of 4914

Page 1 Next