Báo cáo toán học: "Minimum Common String Partition Problem: Hardness and Approximations" pptx

Báo cáo toán học: "Minimum Common String Partition Problem: Hardness and Approximations" pptx

Báo cáo toán học: "Minimum Common String Partition Problem: Hardness and Approximations" pptx

... a string A and a partition Q of a string B,wesaythat the pair π = P, Q is a common partition of A and B if Q is a permutation of P.The minimum common string partition problem is to find a common ... the pair P, Q is a common partition of A and B if Q is a permutation of P.Theminimum common string partition problem (MCSP) is to find a common partition of...
Ngày tải lên : 07/08/2014, 13:21
  • 18
  • 136
  • 0
Báo cáo toán học: "On a Multiplicative Partition Function" pps

Báo cáo toán học: "On a Multiplicative Partition Function" pps

... n,andweletf (n) denote this value. We prove an asymptotic estimate for f (n) which allows us to solve several problems raised in a recent paper by M. V. Subbarao and A. Verma. 1 Introduction and ... 17]). Lemma 2 Let a and b be integers with a<b, and let g be twice differentiable on [a, b] with g  (x) ≥ ρ>0 or g  (x) ≤−ρ<0 for some positive real number ρ and all x ∈ [a,...
Ngày tải lên : 07/08/2014, 06:22
  • 14
  • 248
  • 0
Báo cáo toán học: "Minimum connected dominating sets of random cubic graphs" docx

Báo cáo toán học: "Minimum connected dominating sets of random cubic graphs" docx

... Differential Equation Method for Random Graph Processes and Greedy Algorithms. In Michal Karo´nski and Hans-J¨urgen Pr¨omel, editors, Lectures on Approximation and Randomized Algorithms, pages 73–155. ... N.C. Wormald, Differential Equations for Random Processes and Random Graphs. Annals of Applied Probability, 5:1217–1235, 1995. [13] N.C. Wormald. Models of Random Regular Graphs. In S...
Ngày tải lên : 07/08/2014, 06:23
  • 13
  • 309
  • 0
Báo cáo toán học: "Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers" doc

Báo cáo toán học: "Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers" doc

... Digraphs, and Sign Patterns,” and the authors thank AIM and NSF for their support. the electronic journal of combinatorics 15 (2008), #R25 1 References [AHKLR] M. Arav, F. Hall, S. Koyucu, Z. Li and ... spaces F and C. Thus, each e ∈ E can be uniquely expressed as e = f + c where f ∈ F and c ∈ C. We call f the F -component of e. Theorem 4.1. Let E and F be fields with |E : F | =...
Ngày tải lên : 07/08/2014, 15:23
  • 19
  • 238
  • 0
Báo cáo toán học: "On Stanley’s Partition Function" doc

Báo cáo toán học: "On Stanley’s Partition Function" doc

... Ministry of Education, and the National Science Foundation of China. References [1] G.E. Andrews, The Theory of Partitions, Addison-Wesley, 1976. [2] G.E. Andrews, On a partition function of Richard ... lengths and shall prove that t(n) and the partition function p(n) have the same parity. Moreover, we compute the generating function fo r p(n) − t(n). We shall adopt the common not...
Ngày tải lên : 08/08/2014, 11:20
  • 8
  • 236
  • 0
Báo cáo toán học: "Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs" ppsx

Báo cáo toán học: "Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs" ppsx

... 2.3, P 1 and P 1 uw are not θ-essential paths in G. By Lemma 2.2, both mult(θ, G \ P 1 ) and mult(θ, G \ P 1 uw) is at least 1, i.e. µ(G \ P 1 , x) and µ(G \ P 1 uw, x) have at least one common ... u consists of two disjoint paths Q 1 and Q 2 . Let H 1 and H 2 denote the subgraphs of G 1 induced by Q 1 and Q 2 respectively. By Proposition 4.7, θ-special vertices in H 1 and H 2...
Ngày tải lên : 08/08/2014, 12:23
  • 12
  • 347
  • 0
Báo cáo toán học: "Minimum Weight H-Decompositions of Graphs: The Bipartite Cas" doc

Báo cáo toán học: "Minimum Weight H-Decompositions of Graphs: The Bipartite Cas" doc

... 180–205. [15] M. Simonovits and V. T. S´os, Szemer´edi ’ s partition and q uasi randomness, Random Struct. Algorithms 2 (1991), 1–10. [16] T. Sousa, Decompositions of graphs into 5-cycles and other small ... fixed bipartite graph H and any value of b as n tend s to infinity. 1 Introduction Let G and H be two graphs and b a positive number. A weighted (H, b)-decomposition of G is a...
Ngày tải lên : 08/08/2014, 14:23
  • 10
  • 278
  • 0
Báo cáo toán học: " TiN nanoparticles: small size-selected fabrication and their quantum size effect" doc

Báo cáo toán học: " TiN nanoparticles: small size-selected fabrication and their quantum size effect" doc

... coatings with high demands on hardness and adhesion as well as high thermal stability and good conductivity [10]. Due to this important feature, TiN has been widely used as a hard and protective coating ... the experiment and drafted the manuscript. JLM performed the AFM and HRTEM measurements. AFC and ER analyzed statistically the AFM and HRTEM images. GS carried out the m...
Ngày tải lên : 20/06/2014, 20:20
  • 22
  • 261
  • 0
Báo cáo toán học: " Music-aided affective interaction between human and service robot" pptx

Báo cáo toán học: " Music-aided affective interaction between human and service robot" pptx

... module and to simulate bimodal and multimodal emotion recognition, we used four kinds of emotions or musical moods in each experiment: neutral, happy, angry, and sad. We chose ‘angry’ and ‘sad’ ... emotions facially and vocally. Thus, there are few standard multimodal databases collected from people around the world. Instead, most research studies depend on facial images and s...
Ngày tải lên : 20/06/2014, 20:20
  • 44
  • 277
  • 0
Từ khóa: