Báo cáo toán học: " Enumerating Up-Side Self-Avoiding Walks on Integer Lattices" ppt

Báo cáo toán học: " Enumerating Up-Side Self-Avoiding Walks on Integer Lattices" ppt

Báo cáo toán học: " Enumerating Up-Side Self-Avoiding Walks on Integer Lattices" ppt

... Enumerating Up-Side Self-Avoiding Walks on Integer Lattices Lauren K Williams Harvard University Cambridge, MA 02138 lkwill@husc.harvard.edu Submitted: ... with decomposition and recursive methods. 1Introduction A self-avoiding walk (saw) is a path on a lattice that does not cross the same point twice; on the two-dimensional lattice it is a finite sequence of ... up-side saws...
Ngày tải lên : 07/08/2014, 06:20
  • 12
  • 233
  • 0
Báo cáo toán học: "Enumerating Pattern Avoidance for Affine Permutation" potx

Báo cáo toán học: "Enumerating Pattern Avoidance for Affine Permutation" potx

... mming. Volume 3. Addison-Wesley Publishing Co., Reading, Mass London-Don Mills, Ont., 1973 . Sorting and searching, Addison- Wesley Series in Computer Science and Information Processing. V. Lakshmibai ... permutation is fully commutative if and only if it is 321-avoiding. This means that every reduced expression for ω may be obtained from any other reduced expression using only relations of t...
Ngày tải lên : 08/08/2014, 12:22
  • 13
  • 171
  • 0
Báo cáo toán học: "Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs" ppsx

Báo cáo toán học: "Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs" ppsx

... Observation 2.1 (possibly with slight modifications). Then we consider the following procedure for constructing another Hamilton cycle H: We process the vertices v 1 , . . . , v n−1 one by one and ... the Hamilton cycles of G correspond to the Hamilton cycles of G ′ containing every edge of the form e P . By enumerating all Hamilton cycles of G ′ and ignoring those which do not contain every...
Ngày tải lên : 08/08/2014, 14:23
  • 28
  • 452
  • 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

... optimizations (e.g., data aggregation) before sending the data to the destination sink [6]. Second, in WSNs deployed in harsh environments, source nodes can be affected by several environmental conditions ... this infrastructure, which considers dynamic conditions of multiple sinks and sources. The architecture consists of ‘highways’ in a honeycomb tessellation, which are the three main diagon...
Ngày tải lên : 20/06/2014, 20:20
  • 72
  • 457
  • 0
Báo cáo toán học: " Voice activity detection based on conjugate subspace matching pursuit and likelihood ratio test" pot

Báo cáo toán học: " Voice activity detection based on conjugate subspace matching pursuit and likelihood ratio test" pot

... babble noise conditions. The experi- mental results show that the VAD based on MP coeffi- cients outperforms the ones based on the DFT in all of the testing conditions, and it can be concluded that ... detection. IEEE Trans Speech Audio Process. 16(8):1565–1578 (2008) 13. J Ramirez, JM Gorriz, JC Segura, CG Puntonet, AJ Rubio, Speech/non-speech discrimination based on contextual informa...
Ngày tải lên : 20/06/2014, 21:20
  • 12
  • 454
  • 0
Báo cáo toán học: "Ext of certain free product C*-algebras " ppt

Báo cáo toán học: "Ext of certain free product C*-algebras " ppt

... class="bi x0 y1 w3 h 2" alt =""
Ngày tải lên : 05/08/2014, 10:20
  • 11
  • 329
  • 0
Từ khóa: