Báo cáo toán học: "A weighted bilateral shift with no cyclic vector " ppt

Báo cáo khoa học: "A Discriminative Language Model with Pseudo-Negative Samples" pptx

Báo cáo khoa học: "A Discriminative Language Model with Pseudo-Negative Samples" pptx

... training. 3 Discriminative Language Model with Pseudo-Negative samples We propose a novel discriminative language model; a Discriminative Language Model with Pseudo- Negative samples (DLM-PN). In this model, pseudo-negative ... propose a novel discrim- inative language model, which can be ap- plied quite generally. Compared to the well known N-gram language mod...
Ngày tải lên : 08/03/2014, 02:21
  • 8
  • 315
  • 0
Báo cáo toán học: " A novel algorithm to form stable clusters in vehicular ad hoc networks on highways" doc

Báo cáo toán học: " A novel algorithm to form stable clusters in vehicular ad hoc networks on highways" doc

... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A novel algorithm to form stable clusters in ... parameter to create the clusters. Thus, the clusters are more stable and have longer lifetime. Overhead for clustering All clustering algorithms incur some additional...
Ngày tải lên : 20/06/2014, 20:20
  • 33
  • 293
  • 0
Báo cáo toán học: " A virtual infrastructure based on honeycomb tessellation for data dissemination in multi-sink mobile wireless sensor networks" pot

Báo cáo toán học: " A virtual infrastructure based on honeycomb tessellation for data dissemination in multi-sink mobile wireless sensor networks" pot

... infrastructure based on honeycomb tes- sellation and the protocol based on it, hexagonal cell -based data dissemination (HexDD). HexDD is a geographical routing protocol based on this virtual in- frastructure ... node can disseminate the data towards the rendezvous area instead of storing it locally. Thus, the virtual infrastructure enables data persistence...
Ngày tải lên : 20/06/2014, 20:20
  • 72
  • 457
  • 0
Báo cáo toán học: " A novel voice activity detection based on phoneme recognition using statistical model" pdf

Báo cáo toán học: " A novel voice activity detection based on phoneme recognition using statistical model" pdf

... (HTML) versions will be made available soon. A novel voice activity detection based on phoneme recognition using statistical model EURASIP Journal on Audio, Speech, and Music Processing 2012, 2012:1 ... Ishizuka, H Kato, Noise Robust Voice Activity Detection based on Statistical Model and Parallel Non-linear Kalman Filtering, in Proceedings ofthe IEEE Inter...
Ngày tải lên : 20/06/2014, 20:20
  • 28
  • 475
  • 0
Báo cáo toán học: " A phenomenological model of seizure initiation suggests network structure may explain seizure frequency in idiopathic generalised epilepsy" potx

Báo cáo toán học: " A phenomenological model of seizure initiation suggests network structure may explain seizure frequency in idiopathic generalised epilepsy" potx

... doi:10.1186/2190-8567-2-1 Oscar Benjamin (oscar.benjamin@bristol.ac.uk) Thomas H.B. Fitzgerald (thbfitz@gmail.com) Peter Ashwin (p.ashwin@exeter.ac.uk) Krasimira Tsaneva-Atanasova (k.tsaneva-atanasova@bristol.ac.uk) Fahmida ... net- work structure may explain seizure frequency in idiopathic generalised epilepsy Oscar Benjamin 1 , Thomas H. B. Fitzgerald 2 , Peter Ashwin 3 , Kr...
Ngày tải lên : 20/06/2014, 20:20
  • 54
  • 401
  • 0
Báo cáo toán học: "A Note on Maximal Nonhamiltonian Burkard–Hammer Graphs" pptx

Báo cáo toán học: "A Note on Maximal Nonhamiltonian Burkard–Hammer Graphs" pptx

... any nonhamiltonian Burkard–Hammer graph is contained in a maximal nonhamil- tonian Burkard–Hammer graph. So knowledge about maximal nonhamiltonian Burkard–Hammer graphs provides us certain information about nonhamiltonian Burkard–Hammer ... assume that all con- sidered in this paper maximal nonhamiltonian Burkard–Hammer graphs G = S(I ∪ K, E)haveδ(G)=|I|−k where |I|≥k...
Ngày tải lên : 06/08/2014, 05:20
  • 13
  • 331
  • 0
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

... β invariant from matroids to greedoids, con- centrating especially on antimatroids. Several familiar expansions for β( G) have greedoid analogs. We give combinatorial interpretations for β( G )for simplicial ... greedoid and let {e}∈F. Then β( G) =β( G/e)+(−1) r(G)−r(G−e) β( G − e). We remark that since r(G − e)=r(G) for all non-isthmuses e in a matroid G, the formula above...
Ngày tải lên : 07/08/2014, 06:20
  • 13
  • 285
  • 0
Báo cáo toán học: "Optimal double-loop networks with non-unit steps" pptx

Báo cáo toán học: "Optimal double-loop networks with non-unit steps" pptx

... Optimal double-loop networks with non-unit steps ∗ F. Aguil´o, E. Sim´o and M. Zaragoz´a Dept. de Matem`atica Aplicada ... a double-loop with linked tile L = L(l, h, w, y).LetM be the matrix defining the tiling related to L,withgcd(l, h, w, y)=1and area N = lh − wy.LetS(M)=diag(1,N) be the Smith normal form of M, with ... minimum distance diagram of double-loop networks, IEEE...
Ngày tải lên : 07/08/2014, 07:21
  • 13
  • 246
  • 0
Báo cáo toán học: "A note on graphs without short even cycles" pptx

Báo cáo toán học: "A note on graphs without short even cycles" pptx

... irregular graphs, Graphs and Combinatorics 18 (2002), 53–57. [2] N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, second edition, 1993. [3] J.A. Bondy, M. Simonovits, Cycles ... vine on P ∗ and P ∗ is the unique uv-geodesic. Proof. Suppose, for a contradiction, that H is not a vine on P ∗ .Letx ≺ v be a vertex of P ∗ at a maximum distance from u on P ∗ such th...
Ngày tải lên : 07/08/2014, 08:22
  • 6
  • 241
  • 0
Báo cáo toán học: "A sharp bound for the reconstruction of partitions" ppt

Báo cáo toán học: "A sharp bound for the reconstruction of partitions" ppt

... agree above row r and to the left of column c (and the definitions of r and c) we see that the only possibility for /à is (r, c), completing the proof of this case and the theorem. Acknowledgements. ... 308, 9 (2008), 1524–1530. the electronic journal of combinatorics 15 (2008), #N23 4 A sharp bound for the reconstruction of partitions Vincent Vatter Departme...
Ngày tải lên : 07/08/2014, 15:22
  • 4
  • 339
  • 0
Báo cáo toán học: "A Bijection between Atomic Partitions and Unsplitable Partitions" ppt

Báo cáo toán học: "A Bijection between Atomic Partitions and Unsplitable Partitions" ppt

... ind exed by unsplitable partitions . Can and Sagan raised the qu estion of finding a bijection between atomic partitions and unsplitable partitions. In this paper, we provide such a bijection. 1 ... and unsplitable. Our bijection will be concerned with atomic partitions that are splitable and unsplitable partitions that are not atomic. In other words, we sh...
Ngày tải lên : 08/08/2014, 12:23
  • 7
  • 356
  • 0

Xem thêm

Từ khóa: