Organizational decision making often involves two decision levels. When the leader at the upper level attempts to optimize hislher objective, the follower at the lower level tries to find an optimized strategy according to each of possible decisions made by the leader. Furthermore, such bilevel decision making may involve uncertain parameters which appear either in the objective functions or co...

An upper bound on operator norms of compound matrices is presented and special cases that involve the l l and l norms are investigated The results are then used to obtain bounds on products of the largest or smallest eigenvalues of a matrix The research was started while the rst author visited the Technion in It was continued during a visit of the second author at Universit at Bielefeld and at ...

Describing textures is a challenging problem in computer vision and pattern recognition. The classification problem involves assigning a category label to the texture class it belongs to. Several factors such as variations in scale, illumination and viewpoint make the problem of texture description extremely challenging. A variety of histogram based texture representations exists in literature....

Recent progress in the field of human action recognition points towards the use of Spatio-Temporal Interest Points (STIPs) for local descriptor-based recognition strategies. In this paper, we present a novel approach for robust and selective STIP detection, by applying surround suppression combined with local and temporal constraints. This new method is significantly different from existing STI...

We describe a spoken dialogue system domain: that of the personal secretary. This domain allows us to capitalise on the characteristics that make speech a unique interface; characteristics that humans use regularly, implicitly, and with remarkable ease. We present a prototype system – the KTH Connector – and highlight several dialogue research issues arising in the domain.

Given a pair of non-negative integers m and n, S(m,n) denotes a square lattice graph with a vertex set {0, 1, 2, . . . ,m − 1} × {0, 1, 2, . . . , n− 1}, where a pair of two vertices is adjacent if and only if the distance is equal to 1. A triangular lattice graph T (m,n) has a vertex set {(xe1 + ye2) | x ∈ {0, 1, 2, . . . ,m− 1}, y ∈ {0, 1, 2, . . . , n− 1}} where e1 def. = (1, 0), e2 def. = (...