Výsledky vyhledávání - "Optimal-time algorithm"
-
1
An optimal time algorithm for minimum linear arrangement of chord graphs
ISSN: 0020-0255Vydáno: Elsevier Inc 20.07.2013Vydá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
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
ISSN: 0179-5376, 1432-0444Vydáno: New York Springer-Verlag 01.01.2010Vydá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
Structure of quasi-optimal time algorithm for analog circuits design
ISSN: 0735-2727, 1934-8061Vydáno: Heidelberg Allerton Press, Inc 01.11.2012Vydáno v Radioelectronics and communications systems (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
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
ISSN: 0179-5376, 1432-0444Vydáno: New York Springer-Verlag 01.03.2008Vydá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
An Optimal-Time Algorithm for Shortest Paths onRealistic Polyhedra
ISSN: 0179-5376Vydáno: 01.01.2010Vydá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
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs
ISSN: 1382-6905, 1573-2886Vydáno: New York Springer US 01.11.2024Vydá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
An optimal-time algorithm for slope selection
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1989Vydá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
A Novel 3-D Error Correcting Code Model with its Optimal Time Algorithm Analysis
ISBN: 9781424481484, 1424481481Vydáno: IEEE 01.10.2010Vydáno v 2010 International Symposium on Intelligence Information Processing and Trusted Computing (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
An Optimal-Time Algorithm for Slope Selection
ISSN: 0097-5397, 1095-7111Vydáno: 01.08.1989Vydáno v SIAM journal on computing (01.08.1989)Získat plný text
Journal Article -
10
Computing geodesic paths on manifolds
ISSN: 0027-8424Vydáno: United States 21.07.1998Vydáno v Proceedings of the National Academy of Sciences - PNAS (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
An optimal algorithm for the minimum-width cubic shell problem
ISSN: 0167-6377Vydáno: Elsevier B.V 01.09.2023Vydá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
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
ISSN: 1042-9832, 1098-2418Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2012Vydá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
Fuzzy joint points based clustering algorithms for large data sets
ISSN: 0165-0114, 1872-6801Vydáno: Elsevier B.V 01.07.2015Vydá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
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
ISSN: 0925-7721Vydáno: Elsevier B.V 01.02.2016Vydáno v Computational geometry : theory and applications (01.02.2016)“…) in the worst case, our algorithm is worst-case optimal for k=Ω(nα(n)logn), and is only a factor of α(n) away from any optimal-time algorithm, which is still unknown…”
Získat plný text
Journal Article -
15
On the structure of the fundamental subspaces of acyclic matrices with 0 in the diagonal
ISSN: 2768-4202, 2768-4202Vydáno: American Journal of Combinatorics 22.08.2023Vydá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
On intersecting a set of parallel line segments with a convex polygon of minimum area
ISSN: 0020-0190, 1872-6119Vydáno: Amsterdam Elsevier B.V 2008Vydáno v Information processing letters (2008)Získat plný text
Journal Article -
17
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 1999Vydá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
Clinical Justification for Preliminary Thermal Exposure to Composite in the Treatment of Caries: Randomized Clinical Trial
ISSN: 1608-6228, 2541-9544Vydáno: Ministry of Healthcare of the Russian Federation. “Kuban State Medical University” 15.08.2023Vydáno v Kubanskiĭ nauchnyĭ medit︠s︡inskiĭ vestnik (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
A heuristic fault tolerant MapReduce framework for minimizing makespan in Hybrid Cloud Environment
Vydáno: IEEE 01.03.2014Vydáno v 2014 International Conference on Green Computing Communication and Electrical Engineering (ICGCCEE) (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
The transportation metric and related problems
ISSN: 0020-0190, 1872-6119Vydáno: Amsterdam Elsevier B.V 31.08.2005Vydáno v Information processing letters (31.08.2005)Získat plný text
Journal Article

