Výsledky vyhledávání - "Optimal-time algorithm"

  1. 1

    An optimal time algorithm for minimum linear arrangement of chord graphs Autor Raoufi, Pariya, Rostami, Habib, Bagherinezhad, Hessam

    ISSN: 0020-0255
    Vydáno: Elsevier Inc 20.07.2013
    Vydáno v Information sciences (20.07.2013)
    “…A linear arrangement ϕ of an undirected graph G=(V,E) with ∣V∣=n nodes is a bijective function ϕ:V→{0,…,n−1}. The cost function is cost(G,ϕ)=∑uv∈E|(ϕ(u)-ϕ(v))|…”
    Získat plný text
    Journal Article
  2. 2

    An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra Autor Schreiber, Yevgeny

    ISSN: 0179-5376, 1432-0444
    Vydáno: New York Springer-Verlag 01.01.2010
    Vydáno v Discrete & computational geometry (01.01.2010)
    “…We generalize our optimal-time algorithm for computing (an implicit representation…”
    Získat plný text
    Journal Article
  3. 3

    Structure of quasi-optimal time algorithm for analog circuits design Autor Zemliak, A. M.

    ISSN: 0735-2727, 1934-8061
    Vydáno: Heidelberg Allerton Press, Inc 01.11.2012
    “…The generalized methodology developed earlier for analog circuits design and based on applying the optimal control theory is the basis for developing an…”
    Získat plný text
    Journal Article
  4. 4

    An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions Autor Schreiber, Yevgeny, Sharir, Micha

    ISSN: 0179-5376, 1432-0444
    Vydáno: New York Springer-Verlag 01.03.2008
    Vydáno v Discrete & computational geometry (01.03.2008)
    “…We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions…”
    Získat plný text
    Journal Article
  5. 5

    An Optimal-Time Algorithm for Shortest Paths onRealistic Polyhedra Autor Schreiber, Yevgeny

    ISSN: 0179-5376
    Vydáno: 01.01.2010
    Vydáno v Discrete & computational geometry (01.01.2010)
    “…We generalize our optimal-time algorithm for computing (an implicit representation…”
    Získat plný text
    Journal Article
  6. 6

    The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs Autor Nishat, Rahnuma Islam, Srinivasan, Venkatesh, Whitesides, Sue

    ISSN: 1382-6905, 1573-2886
    Vydáno: New York Springer US 01.11.2024
    Vydáno v Journal of combinatorial optimization (01.11.2024)
    “…An s ,  t Hamiltonian path P for an m × n rectangular grid graph G is a Hamiltonian path from the top-left corner s to the bottom-right corner t . We define an…”
    Získat plný text
    Journal Article
  7. 7

    An optimal-time algorithm for slope selection Autor COLE, R, SALOWE, J. S, STEIGER, W. L, SZEMEREDI, E

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1989
    Vydáno v SIAM journal on computing (01.08.1989)
    “…Given $n$ points in the plane and an integer $k$, the problem of selecting that pair of points that determines the line with the $k$th smallest or largest…”
    Získat plný text
    Journal Article
  8. 8

    A Novel 3-D Error Correcting Code Model with its Optimal Time Algorithm Analysis Autor Guo-qiang Yu, Jian-an Mo

    ISBN: 9781424481484, 1424481481
    Vydáno: IEEE 01.10.2010
    “…For improving the reliability of the data stored up, this paper brings forward an improvement scheme. It expands the error correction from One-dimensional…”
    Získat plný text
    Konferenční příspěvek
  9. 9
  10. 10

    Computing geodesic paths on manifolds Autor Kimmel, R, Sethian, J A

    ISSN: 0027-8424
    Vydáno: United States 21.07.1998
    “… As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulated manifolds…”
    Zjistit podrobnosti o přístupu
    Journal Article
  11. 11

    An optimal algorithm for the minimum-width cubic shell problem Autor Bae, Sang Won

    ISSN: 0167-6377
    Vydáno: Elsevier B.V 01.09.2023
    Vydáno v Operations research letters (01.09.2023)
    “… This is the first optimal-time algorithm to the problem…”
    Získat plný text
    Journal Article
  12. 12

    Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges Autor Gronau, Ilan, Moran, Shlomo, Snir, Sagi

    ISSN: 1042-9832, 1098-2418
    Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2012
    Vydáno v Random structures & algorithms (01.05.2012)
    “…Phylogenetic reconstruction methods attempt to reconstruct a tree describing the evolution of a given set of species using sequences of characters (e.g. DNA)…”
    Získat plný text
    Journal Article
  13. 13

    Fuzzy joint points based clustering algorithms for large data sets Autor Nasibov, Efendi, Atilgan, Can, Berberler, Murat Ersen, Nasiboglu, Resmiye

    ISSN: 0165-0114, 1872-6801
    Vydáno: Elsevier B.V 01.07.2015
    Vydáno v Fuzzy sets and systems (01.07.2015)
    “… In this work, we integrate various methods with FJP to establish an optimal-time algorithm. An even faster algorithm which uses the FJP approach in a somewhat supervised fashion is also proposed. Along with theoretic comparison, experimental results are presented to show the significant speed improvement, which will allow the FJP-based methods to be used on large data sets…”
    Získat plný text
    Journal Article
  14. 14

    An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments Autor Bae, Sang Won

    ISSN: 0925-7721
    Vydáno: Elsevier B.V 01.02.2016
    “…) in the worst case, our algorithm is worst-case optimal for k=Ω(nα(n)log⁡n), and is only a factor of α(n) away from any optimal-time algorithm, which is still unknown…”
    Získat plný text
    Journal Article
  15. 15

    On the structure of the fundamental subspaces of acyclic matrices with 0 in the diagonal Autor Jaume, Daniel, Pastine, Adrian

    ISSN: 2768-4202, 2768-4202
    Vydáno: American Journal of Combinatorics 22.08.2023
    Vydáno v The American journal of combinatorics (22.08.2023)
    “… We combine these with an algorithm for finding a sparsest basis of the null space of a forest to provide an optimal time algorithm for finding a sparsest basis…”
    Získat plný text
    Journal Article
  16. 16
  17. 17

    An Optimal Algorithm for Euclidean Shortest Paths in the Plane Autor Hershberger, John, Suri, Subhash

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 1999
    Vydáno v SIAM journal on computing (1999)
    “…We propose an optimal-time algorithm for a classical problem in plane computational geometry…”
    Získat plný text
    Journal Article
  18. 18

    Clinical Justification for Preliminary Thermal Exposure to Composite in the Treatment of Caries: Randomized Clinical Trial Autor Shipieva, U. A., Adamchik, A. A., Gushchin, A. A., Samhaev, V. N., Kirsh, K. D., Adamchik, M. A., Risovannaya, N. O.

    ISSN: 1608-6228, 2541-9544
    Vydáno: Ministry of Healthcare of the Russian Federation. “Kuban State Medical University” 15.08.2023
    “…Background. Polymer composites have good aesthetic characteristics and pronounced physicochemical properties, as compared to traditional restorative materials…”
    Získat plný text
    Journal Article
  19. 19

    A heuristic fault tolerant MapReduce framework for minimizing makespan in Hybrid Cloud Environment Autor Raju, R., Amudhavel, J., Pavithra, M., Anuja, S., Abinaya, B.

    Vydáno: IEEE 01.03.2014
    “… In this paper, we developed a new strategy, OTA (Optimal Time Algorithm), which improves the effectiveness of speculative execution significantly…”
    Získat plný text
    Konferenční příspěvek
  20. 20

    The transportation metric and related problems Autor Ostrovsky-Berman, Yaron

    ISSN: 0020-0190, 1872-6119
    Vydáno: Amsterdam Elsevier B.V 31.08.2005
    Vydáno v Information processing letters (31.08.2005)
    Získat plný text
    Journal Article