We explore the potential of anytime best-first search schemes for combinatorial optimization tasks over graphical models (e.g., MAP/MPE). We show that recent advances in extending best-first search into an anytime scheme have a potential for optimization for graphical models. Importantly, these schemes come with upper bound guarantees and are sometime competitive with known effective anytime br...

Based on a coin-tossing scheme, a generalized Mahonian statistic is defined on absorption ring mappings and applied in obtaining combinatorial interpretations of the coefficient of q j in the expansion of > k i=1 (1+q+q 2 + } } } +q m i). In the permutation case, the statistic coincides with one studied by Han that specializes many known Mahonian statistics.

We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [6]. We introduce a formalism, called search schemes, to specify search strategies of this type, then develop a probabilistic measure for the efficiency of a search scheme, prove several combinatorial results on efficient search schemes, and finally, provide experimen...

We introduced here an interesting tool for the structural study of chordal graphs, namely the Reduced Clique Graph. Using some of its combinatorial properties we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via a minimal separator maximal under inclusion among all minimal separators.

Let (Y; A) be an association scheme with primitive idempotents E 0 ; E 1 ;. .. ; E d. For T f1;. .. ; dg, a Delsarte T-design in (Y; A) is a subset D of Y whose characteristic vector is annihilated by the idempotents E j (j 2 T). The case most studied is that in which (Y; A) is Q-polynomial and T = f1;. .. ; tg. For many such examples, a combina-torial characterization is known, giving an equiv...

In this paper, we study incentive compatible mechanism based on linear pricing scheme for single-minded auction, a restricted case of combinatorial auction, in which each buyer desires a unique fixed bundle of various commodities, improving the previous works [1, 11, 13] on pricing bundles (i.e., payments of buyers).

We show a construction of a quantum ramp secret sharing scheme from a nested pair of linear codes. Necessary and sufficient conditions for qualified sets and forbidden sets are given in terms of combinatorial properties of nested linear codes. An algebraic geometric construction for quantum secret sharing is also given.