نتایج جستجو برای: consecutive separating

تعداد نتایج: 119701  

Journal: :IJAC 2011
Stepan Holub Juha Kortelainen

Partitions {Lk}k=1 of A + into m pairwise disjoint languages L1, L2, . . . , Lm such that Lk = L + k for k = 1, 2, . . . , m are considered. It is proved that such a closed partition of A+ can separate the words u1, u2, . . . , um ∈ A+ (i.e. each Lk contains exactly one word of the sequence u1, u2, . . . , um) if and only if for each pair i, j of distinct elements in {1, 2, . . . , m}, the word...

Journal: :Discrete Mathematics 2013
Yanmei Hong Hong-Jian Lai

Lovász conjectured that there is a smallest integer f (l) such that for every f (l)-connected graph G and every two vertices s, t of G there is a path P connecting s and t such that G − V (P) is l-connected. This conjecture is still open for l ≥ 3. In this paper, we generalize this conjecture to a k-vertex version: is there a smallest integer f (k, l) such that for every f (k, l)-connected grap...

2006
Søren Tjagvad Madsen Gerhard Widmer

This paper presents an algorithm for converting midi events into logical voices. The algorithm is fundamentally based on the pitch proximity principle. New heuristics are introduced and evaluated in order to handle unsolved situations. The algorithm is tested on ground truth data: inventions and fugues by J. S. Bach. Due to its left to right processing it also runs on real time input.

2014
Barbora Ulipová Marek Grác

In this paper, we analyze the situation of long sequences of mostly capitalized words which look like a named entity but in fact they consist of several named entities. An example of such phenomena is hokejista (hockey player) New York Rangers Jaromír Jágr. Without splitting the sequence correctly, we will wrongly assume that the whole capitalized sequence is a name of the hockey player. To fin...

2001
Nebojsa Jojic Patrice Y. Simard Brendan J. Frey David Heckerman

By representing images and image prototypes by linear subspaces spanned by “tangent vectors” (derivatives of an image with respect to translation, rotation, etc.), impressive invariance to known types of uniform distortion can be built into feedforward discriminators. We describe a new probability model that can jointly cluster data and learn mixtures of nonuniform, smooth deformation fields. O...

Journal: :The Journal of Cell Biology 2005
Nicole LeBrasseur

Spines reach out ored dendritic spines look for new challenges, say David Richards, R. Anne McKinney (in work done at the University of Zurich, Switzerland), and colleagues. Spines are small dendritic protrusions on which excitatory synapses connect to axons. Recent evidence suggested that spines are mobile even in adults. Richards et al. now suggest that this mobility allows for post-developme...

1996
TIMOTHY L. BAILEY

Fitting the parameters of a discrete nite mixture distribution to a set of data using the EM algorithm can be extremely diicult when the likelihood surface has many local maxima, the form of the components is unknown, and the number of components is unknown. The exponential explosion in the number of diierent models and diierent starting points for EM which must be tested can be reduced by ndin...

Journal: :Discrete Mathematics 2006

Journal: :Academic Medicine 1968

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید