Báo cáo toán học: "ords with simple Burrows-Wheeler Transforms" pot
Báo cáo toán học: "Submanifolds with Parallel Mean Curvature Vector Fields and Equal Wirtinger Angles in Sasakian Space Forms" potx
... immersion with equal Wirtinger
angle θ, then (cf. [7. 8])
PX,PY =cos
2
θX, Y ,X,Y∈ TM,
with cos θ a locally Lipschitz function on M ,smoothontheopensetwhereit
does not vanish. On an open set without ... generalized
Wolfson’s theorem [18] to higher dimensions (i.e. n ≥ 2withequalK¨ahler
angles). The author [15] generalized the theorem to submanifolds with parallel
mean vector fields b...
Báo cáo toán học: "Sorting with a Forklift" doc
... creates the first 13 be B with top
element b, the contents of the working stack just prior to this move be S with top element
s, the remaining contents of the input stack be I with top element i, and ... internally within a
potential rise-fall sequence, but as red ones if they form either end of such a sequence.
Formally then, we begin recording on the notepad each time that a pop sequen...
Báo cáo toán học: "Strings with maximally many distinct subsequences and substrings" ppsx
...
d
)
d
, for some
d
→ 0.
3 Strings with maximally many distinct substrings
We close with a solution to a simpler problem, choosing an n-long string A with a maxi-
mum number of substrings ... asymptotically maximal. Also, for any c<1, a simple
calculation shows that each string of length m ≤ c log
d
n will occur as a substring of n
with high probability (probability exp(−n
1−c...
Báo cáo toán học: "Coloring with no 2-colored P4’s" pdf
... a recursive construction with base cases G
1
= K
1
and G
2
= P
4
.Lett ≥ 3
and G
t−1
be a chordal graph with ω(G
t−1
)=t − 1andχ
s
(G
t−1
)=
t
2
.LetP be a
path with vertices denoted u
1
, ... construct the gadget graph G
(t)
by replacing every edge uv of G with a
separate copy of K
2,t
in such a fashion that u and v are identified with the vertices in the
part of size 2. Note th...
Báo cáo toán học: "Graphs with chromatic roots in the interval (1, 2)" doc
... showed that graphs with a hamiltonian path have
no chromatic roots in (1, 1.29559 . . .). Both Jackson’s graphs with chromatic roots close to
32/27 and Thomassen’s graphs with chromatic roots ... chromatic polynomial separately. However as our concern is only with the
value of this derivative at x = 2, we can ignore any terms with factors of (x − 2)
s
or
(x − 2)
t
(or both) as these...
Báo cáo toán học: "Graphs with many copies of a given subgraph" ppt
... the graph obtained by replacing
each vertex u ∈ V (H) with a set V
u
of size x
u
and each edge uv ∈ E(H) with a complete
bipartite graph with vertex classes V
u
and V
v
.
Theorem 1 Let 2 ≤ r ... but is simple.
- Using random graphs, it is easy to see that most graphs on n vertices contain
substantially many copies of any fixed graph, but contain no complete bipartite
subgraphs with b...
Báo cáo khoa học: "Paraphrasing with Bilingual Parallel Corpora" pot
... aligning it with its Ger-
man equivalent by correcting the automatic align-
ment, as shown in Figure 3a. All occurrences of
its German equivalents were then highlighted, and
aligned with their ... are aligned
with different German phrases.
When we calculate the paraphrase probability we
sum over different target language phrases. There-
fore the English phrases that are aligned with t...
Từ khóa: