Related papers: Minimal fragmentation problem
Clustering attempts to partition data instances into several distinctive groups, while the similarities among data belonging to the common partition can be principally reserved. Furthermore, incomplete data frequently occurs in many…
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems…
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a…
Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this…
Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However,…
Fragment-based shape signature techniques have proven to be powerful tools for computer-aided drug design. They allow scientists to search for target molecules with some similarity to a known active compound. They do not require reference…
We introduce a new method for performing clustering with the aim of fitting clusters with different scatters and weights. It is designed by allowing to handle a proportion $\alpha$ of contaminating data to guarantee the robustness of the…
For the calculation of the partition function $\mathcal{Z}$ of small, isolated and interacting many body systems an improvement with respect to previous formulations is presented. By including anharmonicities and employing a variational…
Nuclear multifragmentation process can be viewed as a recombination of nucleons into clusters of various sizes. In a combinatorial analysis, various moments of cluster size distribution appear to be quite simple in terms of canonical…
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a…
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
The incorporation of particle inertia into the usual mean field theory for particle aggregation and fragmentation in fluid flows is still an unsolved problem. We therefore suggest an alternative approach that is based on the dynamics of…
We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…
We study a variational problem motivated by models of species population density in a nonhomogeneous environment. We first analyze local minimizers and the structure of the saturated region (where the population attains its maximal density)…
This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…
The most important characteristics of the fragmentation of heterogeneous solids is that the mass (size) distribution of pieces is described by a power law functional form. The exponent of the distribution displays a high degree of…
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
Fragment properties of hot fragmenting sources of similar sizes produced in central and semi-peripheral collisions are compared in the excitation energy range 5-10 AMeV. For semi-peripheral collisions a method for selecting compact…