Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-...

A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed...

The nite-element, semi-implicit, and semi-Lagrangian methods are combined together to solve the shallow-water equations using unstructured triangular meshes. Triangular nite elements are attractive for ocean modeling because of their exibility for representing irregular boundaries and for local mesh re nement. A \kriging" interpolator is used for the semi-Lagrangian advection, leading to an acc...

A central question concerning word recognition is whether linguistic categories are processed in continuous or categorical ways, in particular, whether regular and irregular inflection is stored and processed by the same or by distinct systems. Here, we contribute to this issue by contrasting regular (regular stem, regular suffix) with semi-irregular (regular stem, irregular suffix) and irregul...

A helicopter deck is the main load-bearing component under emergency landing conditions for helicopters. However, it generally difficult to directly obtain load from measurements due high randomness of position. As design deck, very important its structural design. large value leads an overly conservative and affects control ship’s weight center gravity, while a small may lead lack security aff...

Standard spatial convolutions assume input data with a regular neighborhood structure. Existing methods typically generalize convolution to the irregular point cloud domain by fixing “view” through e.g. fixed size, where kernel size remains same for each point. However, since clouds are not as structured images, neighbor number gives an unfortunate inductive bias. We present novel graph named D...

In parallelizing compilers on distributed memory systems, distributions of irregular sized array blocks are provided for load balancing and irregular problems. The irregular data redistribution is different from the regular block-cyclic redistribution. This paper is devoted to scheduling message for irregular data redistribution that attempt to obtain suboptimal solutions while satisfying the m...

I describe an adaptive h-reenement method for solving reaction-diiusion systems in three space dimensions on hexahedral grids. These grids typically have irregular (hanging) nodes. Solutions are calculated using Galerkin's method with a piecewise trilinear basis in space and a BDF code in time. New a posteriori error indicators based on interpolation error estimates for irregular grids are used...

Identifying irregular file system permissions in large, multi-user systems is challenging due to the complexity of gaining structural understanding from large volumes of permission information. This challenge is exacerbated when file systems permissions are allocated in an ad-hoc manner when new access rights are required, and when access rights become redundant as users change job roles or ter...

The automatic parallelization of irregular codes for massively parallel systems is a challenging problem of growing importance. This paper describes techniques for processing irregular codes that are being implemented in the Prepare HPF compiler. Our work makes two contributions: (1) it constructs a library called Parti+ that is used for the runtime analysis of codes with runtime data dependent...