Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 6 / 6
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Vertex-transitive expansions of (1, 3)-trees
Marko Lovrečič Saražin, Dragan Marušič, 2010, objavljeni znanstveni prispevek na konferenci

Opis: A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same length. Given a graph ▫$X$▫ with a semiregular automorphism ▫$\gamma$▫, the quotient of ▫$X$▫ relative to ▫$\gamma$▫ is the multigraph ▫$X/\gamma$▫ whose vertices are the orbits of ▫$\gamma$▫ and two vertices are adjacent by an edge with multiplicity ▫$r$▫ if every vertex of one orbit is adjacent to ▫$r$▫ vertices of the other orbit. We say that ▫$X$▫ is an expansion of ▫$X/\gamma$▫. In [J.D. Horton, I.Z. Bouwer, Symmetric ▫$Y$▫-graphs and ▫$H$▫-graphs, J. Combin. Theory Ser. B 53 (1991) 114-129], Hortonand Bouwer considered a restricted sort of expansions (which we will call :strong" in this paper) where every leaf of ▫$X/\gamma$▫ expands to a single cycle in ▫$X$▫. They determined all cubic arc-transitive strong expansions of simple ▫$(1,3)$▫-trees, that is, trees with all of their vertice shaving valency 1 or 3, thus extending the classical result of Frucht, Graver and Watkins (see [R. Frucht, J.E. Graver, M.E. Watkins, The groups of the generalized Petersen graphs, Proc. Cambridge Philos. Soc. 70 (1971) 211-218]) about arc-transitive strong expansions of ▫$K_2$▫ (also known as the generalized Petersen graphs). In this paper another step is taken further by considering the possible structure of cubic vertex-transitive expansions of general ▫$(1,3)$▫-multitrees (where vertices with double edges are also allowed); thus the restriction on every leaf to be expanded to a single cycle is dropped.
Najdeno v: ključnih besedah
Povzetek najdenega: ...graph, tree, cubic, vertex-transitive, arc-transitive, expansion...
Ključne besede: graph, tree, cubic, vertex-transitive, arc-transitive, expansion
Objavljeno: 15.10.2013; Ogledov: 1794; Prenosov: 29
URL Polno besedilo (0,00 KB)

2.
Parse tree based machine translation for less-used languages
Jernej Vičič, Andrej Brodnik, 2008, izvirni znanstveni članek

Opis: The article describes a method that enhances translation performance of language pairs with a less used source language and a widely used target language. We propose a method that enables the use of parse tree based statistical translation algorithms for language pairs with a less used source language and a widely used target language. Automatic part of speech (POS) tagging algorithms have become accurate to the extent of efficient use in many tasks. Most of these methods are quite easily implementable in most world languages. The method is divided in two parts; the first part constructs alignments between POS tags of source sentences and induced parse trees of target language. The second part searches through trained data and selects the best candidates for target sentences, the translations. The method was not fully implemented due to time constraints; the training part was implemented and incorporated into a functional translation system; the inclusion of a word alignment model into the translation part was not implemented. The empirical evaluation addressing the quality of trained data was carried out on a full implementation of the presented training algorithms and the results confirm the employability of the method.
Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: machine translation, parse tree
Objavljeno: 15.10.2013; Ogledov: 2734; Prenosov: 24
URL Polno besedilo (0,00 KB)

3.
On distance integral graphs
Dragan Stevanović, Marko Milošević, Milan Pokorný, Pavel Híc, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...distance spectrum, distance integral graph, tree, complete split graph, ...
Ključne besede: distance spectrum, distance integral graph, tree, complete split graph
Objavljeno: 03.04.2017; Ogledov: 658; Prenosov: 51
URL Polno besedilo (0,00 KB)

4.
Automatic bronchial tree segmentation using 3D isosurface projection
Daniel Moses, Claude Sammut, Tatjana Zrimec, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: bronchial tree, segmentation, isosurface, CT
Objavljeno: 08.08.2016; Ogledov: 1005; Prenosov: 11
URL Polno besedilo (0,00 KB)

5.
Limiting behavior of 3-color excitable media on arbitrary graphs
Janko Gravner, Hanbaek Lyu, David Sivakoff, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...excitable media, cellular automaton, tournament expansion, tree-indexed random walk...
Ključne besede: excitable media, cellular automaton, tournament expansion, tree-indexed random walk
Objavljeno: 21.01.2019; Ogledov: 157; Prenosov: 164
.pdf Polno besedilo (901,07 KB)
Gradivo ima več datotek! Več...

6.
Recognizing graph search trees
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Mitrović, Robert Scheffler, Martin Strehler, 2019, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...search tree recognition, LBFS, LDFS, MNS, MCS...
Ključne besede: search tree recognition, LBFS, LDFS, MNS, MCS
Objavljeno: 16.10.2019; Ogledov: 0; Prenosov: 0
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici