The performance of local stereo matching algorithm highly depends on the support window selected, in which the cost are aggregated. A variety of cost aggregation approaches (proposed before 2008) were comprehensively analyzed in [7] and these approaches attempt to seek an optimal support window for each pixel by changing the window size, shape and center offset. The ideal optimal window should ...

An extension theorem for general weight functions is proved over nite chain rings. The structure of the complex semigroup ring associated to the multiplicative semigroup of the ring plays a prominent role in the proof. 1. Background In her doctoral dissertation, MacWilliams 7], 8] proved an equivalence theorem: two linear codes C 1 ; C 2 F n deened over a nite eld F are equivalent up to monomia...

Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Indexing to be poor at handling large volumes of data and evaluate the use of weighting functions for improving the performance of Random Indexing. We find that Random Index is robust for small data sets, but performance d...

Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here, we consider the case that the weight determining the acceptance probability itself is fluctuating. This situation is common in many numerical studies. We show that it is p...

We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the specification to allow for weight functions with accumulation, which is particularly useful when the weight of each element depends on adjacent elements. This extension of weight functions enables us to treat more interesti...

Let X be a finite set with n elements. A function f : X −→ R such that ∑ x∈X f (x) ≥ 0 is called a n-weight function. In 1988 Manickam and Singhi conjectured that, if d is a positive integer and f is a n-weight function with n ≥ 4d there exist at least (n−1 d−1 ) subsets Y of X with |Y | = d for which ∑ y∈Y f (y) ≥ 0. In this paper we study this conjecture and we show that it is true if f is a ...