Keywords: طراحی الگوریتم ها; Process mining; Formal languages and automata; Petri nets; Design of algorithms;
مقالات ISI طراحی الگوریتم ها (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: طراحی الگوریتم ها; Design of algorithms; Natural image; CG image; Generalized Gaussian distribution; Maximum likelihood estimation;
Keywords: طراحی الگوریتم ها; Analysis of algorithms; Design of algorithms; Graph algorithms;
Keywords: طراحی الگوریتم ها; Design of algorithms; Pattern matching; Threshold; Recursion;
Keywords: طراحی الگوریتم ها; Design of algorithms; interval graphs; signed edge domination number;
Keywords: طراحی الگوریتم ها; Design of algorithms; Collective keyword query; Road networks; Approximate algorithms;
Keywords: طراحی الگوریتم ها; Analysis of algorithms; Design of algorithms; Hashing; Perfect word hash functions; Integers;
Keywords: طراحی الگوریتم ها; Scheduling; Restricted assignment problem; Design of algorithms
Keywords: طراحی الگوریتم ها; Activity testing; Automatic correction; Hand pointing; Rehabilitation; Design of algorithms
Keywords: طراحی الگوریتم ها; Packing problem; Heuristic algorithm; Recursive; Design of algorithms
Keywords: طراحی الگوریتم ها; Design of algorithms; Zhang neural networks (ZNN); Linear matrix inequality (LMI); Time-varying
Keywords: طراحی الگوریتم ها; Recommendation systems; Social networks; Content analysis; Text mining; Design of algorithms
Keywords: طراحی الگوریتم ها; Design of algorithms; Feature selection; Correlation measure; Continuous feature; Discrete feature; Mixture of continuous and discrete features;
Keywords: طراحی الگوریتم ها; Algorithms; Analysis of algorithms; Approximation algorithms; Design of algorithms; Graph algorithms; Relaxed triangle inequality; TSP
Keywords: طراحی الگوریتم ها; Design of algorithms; Face recognition; Sparse representation; Fisher discriminant; Modular weight
Keywords: طراحی الگوریتم ها; Manifold learning; Nonlinear dimensionality reduction; Incremental learning; ISOMAP; Design of algorithms
Keywords: طراحی الگوریتم ها; Design of algorithms; Fixed-parameter tractable; Kernel; Load coloring
Quantum Query as a state decomposition
Keywords: طراحی الگوریتم ها; Quantum exact algorithms; Quantum query complexity; Computational complexity; Analysis of algorithms; Design of algorithms;
A pre-test for factoring bivariate polynomials with coefficients in F2
Keywords: طراحی الگوریتم ها; Algorithms; Computational complexity; Design of algorithms;
A note on easy and efficient computation of full abelian periods of a word
Keywords: طراحی الگوریتم ها; Abelian period; Abelian power; Weak repetition; Design of algorithms; Text algorithms; Combinatorics on words;
Counting inversions adaptively
Keywords: طراحی الگوریتم ها; Algorithms; Analysis of algorithms; Data structures; Design of algorithms
Combined supervised information with PCA via discriminative component selection
Keywords: طراحی الگوریتم ها; Algorithms; Design of algorithms; Principal Component Analysis (PCA); Face recognition; Linear Discriminant Analysis (LDA); Multivariate statistic analysis
Exact algorithms for problems related to the densest k-set problem
Keywords: طراحی الگوریتم ها; Densest (sparsest) k-set; Minimum (maximum) k-vertex cover; Partial vertex cover; Exact algorithm; Design of algorithms
Algorithms for computing Abelian periods of words
Keywords: طراحی الگوریتم ها; Abelian period; Abelian repetition; Weak repetition; Design of algorithms; Text algorithms; Combinatorics on words
Chain rotations: A new look at tree distance
Keywords: طراحی الگوریتم ها; Binary tree; Rotation distance; Chain distance; Upper and lower bounds; Design of algorithms
On the connection between Hamming codes, Heapsort and other methods
Keywords: طراحی الگوریتم ها; Design of algorithms; Hamming codes; Heapsort; Binary search; Subset Sum problem
On certain computations of Pisot numbers
Keywords: طراحی الگوریتم ها; Design of algorithms; Pisot numbers; Lattice reduction; Tau functions; Modular exponentiation
Algorithmic aspect of stratified domination in graphs
Keywords: طراحی الگوریتم ها; Design of algorithms; Graph algorithms; k-stratified graph; Domination; F-domination; NP-complete; Bipartite graph; Planar graph; Chordal graph; Tree
A dynamic programming solution to a generalized LCS problem
Keywords: طراحی الگوریتم ها; Design of algorithms; Longest common subsequence; Generalized LCS; Dynamic programming
An algorithm for fast multiplication of sedenions
Keywords: طراحی الگوریتم ها; Design of algorithms; Sedenion; Multiplication
An efficient bitwise algorithm for intra-procedural data-flow testing coverage
Keywords: طراحی الگوریتم ها; Software engineering; Data structures; Design of algorithms; Data-flow testing coverage; Program instrumentation; Run-time environments
Dynamics of a mean-shift-like algorithm and its applications on clustering
Keywords: طراحی الگوریتم ها; Design of algorithms; Mean-shift algorithm; Stability; Exponential convergence; Clustering
Drawing trees in a streaming model
Keywords: طراحی الگوریتم ها; Design of algorithms; Graph algorithms; Online algorithms; Graph drawing; Streaming; Large graphs
Probabilistic single obnoxious facility location with fixed budget
Keywords: طراحی الگوریتم ها; Design of algorithms; Obnoxious facility location; Expropriation; Maximin; Quantile location problem
Computing hypergraph width measures exactly
Keywords: طراحی الگوریتم ها; Design of algorithms; Graph algorithms; Generalized hypertree-width; Fractional hypertree-width; Exact exponential algorithms
Series-parallel orientations preserving the cycle-radius
Keywords: طراحی الگوریتم ها; Algorithms; Design of algorithms; Graph orientation; Series parallel graphs
Problem reduction heuristic for the 0–1 multidimensional knapsack problem
Keywords: طراحی الگوریتم ها; Heuristic optimization; Design of algorithms; Multi-dimensional knapsack problem; Core problem
Erratum and addendum to “A linear time algorithm for finding all hinge vertices of a permutation graph” [Information Processing Letters 59 (2) (1996) 103–107]
Keywords: طراحی الگوریتم ها; Analysis of algorithms; Design of algorithms; Permutation graphs; Hinge vertices
Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type
Keywords: طراحی الگوریتم ها; Design of algorithms; Scheduling; Differentiation flowshop; Fixed sequences; Dynamic programming
Faster algorithm for optimum Steiner trees
Keywords: طراحی الگوریتم ها; Graph algorithms; Design of algorithms; Steiner tree problem; Dynamic programming; Tree composition
Computing Longest Previous non-overlapping Factors
Keywords: طراحی الگوریتم ها; Design of algorithms; Longest previous factor; Suffix array; Ziv–Lempel factorisation; Text compression; Detection of repetitions
Dominating set based exact algorithms for 3-coloring
Keywords: طراحی الگوریتم ها; Graph algorithms; Design of algorithms; Graph coloring; 3-coloring; Exact algorithms; Exponential time algorithms
The indexing for one-dimensional proportionally-scaled strings
Keywords: طراحی الگوریتم ها; Design of algorithms; String matching; Scale; Proportional
Paired-bacteria optimiser – A simple and fast algorithm
Keywords: طراحی الگوریتم ها; Design of algorithms; Theory of computation; Pseudo gradient; Quorum sensing; Optimisation
On-line construction of parameterized suffix trees for large alphabets
Keywords: طراحی الگوریتم ها; Algorithm; Data structures; Design of algorithms; Randomized algorithms
Fast leader election in anonymous rings with bounded expected delay
Keywords: طراحی الگوریتم ها; Distributed computing; Design of algorithms; Analysis of algorithms
A filtering algorithm for k-mismatch with don't cares
Keywords: طراحی الگوریتم ها; Algorithms; Design of algorithms; Combinatorial problems; String algorithms; Don't cares; Pattern matching; Filtering; Fast Fourier transforms
A modified Guruswami–Sudan algorithm for decoding Reed–Solomon codes
Keywords: طراحی الگوریتم ها; Reed–Solomon codes; List decoding algorithm; Design of algorithms; Computational complexity
Spatial joins based on NA-trees
Keywords: طراحی الگوریتم ها; Design of algorithms; NA-tree; R-tree; Spatial index; Spatial join;
Optimal popular matchings
Keywords: طراحی الگوریتم ها; Design of algorithms; Bipartite graphs; Matchings; One-sided preference lists