11160 search results - page 205 / 2232 » Incompleteness in a General Setting |
123
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
COMBINATORICS
2002
15 years 4 months ago
2002
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
140
click to vote
RSA
2011
14 years 11 months ago
2011
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
158
click to vote
IVC
2007
15 years 4 months ago
2007
In this article a new approach is given for real-time visual tracking of a class of articulated non-rigid objects in 3D. The main contribution of this paper consists in symmetrica...
133
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...