1. On ▫$L^2$▫ approximation by planar Pythagorean-hodograph curvesRida T. Farouki, Marjetka Knez, Vito Vitrih, Emil Žagar, 2025, izvirni znanstveni članek Opis: The ▫$L^2$▫ approximation of planar curves by Pythagorean-hodograph (PH) polynomial curves is addressed, based on the distance defined by a metric for planar curves represented as complex valued functions of a real parameter. Because of the nonlinear nature of polynomial PH curves, constructing ▫$L^2$▫ approximants involves solving a nonlinear optimization problem. However, a simplified method that requires only the solution of a linear system may be developed by formulating the ▫$L^2$▫ approximation in the preimage space. The extension of the methodology to approximation by PH B-spline curves is also addressed, and several examples are provided to illustrate its implementation and potential.
Ključne besede: ▫$L^2$▫ approximation, complex polynomial, Pythagorean-hodograph curve, Pythagorean-hodograph spline, preimage
Objavljeno v RUP: 30.05.2025; Ogledov: 109; Prenosov: 3
 Celotno besedilo (1,33 MB)
Gradivo ima več datotek! Več... |
2. |
3. Scaffolding problems revisited : complexity, approximation and fixed parameter tractable algorithms, and some special casesMathias Weller, Annie Chateau, Clément Jean Dallard, Rodolphe Giroudeau, 2018, izvirni znanstveni članek Ključne besede: complexity, approximation, lower bound, kernel, scaffolding, {ISK4, wheel}-free graph
Objavljeno v RUP: 11.02.2020; Ogledov: 2329; Prenosov: 64
 Povezava na celotno besedilo |
4. |
5. |
6. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Objavljeno v RUP: 17.09.2018; Ogledov: 2974; Prenosov: 123
Povezava na celotno besedilo |
7. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Objavljeno v RUP: 17.09.2018; Ogledov: 2902; Prenosov: 86
Celotno besedilo (1,44 MB)
Gradivo ima več datotek! Več... |
8. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje) Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Objavljeno v RUP: 17.09.2018; Ogledov: 2796; Prenosov: 22
Povezava na celotno besedilo |
9. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Objavljeno v RUP: 08.05.2018; Ogledov: 3371; Prenosov: 160
Povezava na celotno besedilo |
10. The minimum conflict-free row split problem revisitedAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, objavljeni znanstveni prispevek na konferenci Ključne besede: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Objavljeno v RUP: 14.11.2017; Ogledov: 4049; Prenosov: 283
Povezava na celotno besedilo
Gradivo ima več datotek! Več... |
