1732 search results - page 39 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
117
click to vote
DLT
2009
15 years 4 months ago
2009
A word is crucial with respect to a given set of prohibited words (or simply prohibitions) if it avoids the prohibitions but it cannot be extended to the right by any letter of its...
146
click to vote
ISCI
2007
15 years 6 months ago
2007
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
124
click to vote
COMPGEOM
2009
ACM
16 years 20 days ago
2009
ACM
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
173
click to vote
DM
2007
15 years 6 months ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
165
click to vote
NIPS
2004
15 years 7 months ago
2004
We present a generative model and stochastic filtering algorithm for simultaneous tracking of 3D position and orientation, non-rigid motion, object texture, and background texture...