approximation algorithms 中文意思是什麼

approximation algorithms 解釋
第三十五章 近似演算法
  1. Blind adaptive multiuser detection of cdma using the - approximation algorithms

    盲自適應多用戶檢測
  2. 22 b ohning d, lindsay b. monotonicity of quadratic - approximation algorithms

    它可視為二階牛頓迭代演算法的特例。
  3. This paper studies the approximation algorithms of some combinatorial optimization problems

    本文主要研究組合優化中若干問題的近似演算法。
  4. Moreover, the block time - recursive 2 - d rdgt algorithms and their unified parallel lattice structure implementation are extended from 1 - d rdgt case. three applications of the rdgts are investigated : gabor representation for transient signals via the rdgts, mnr fid signal enhancement via the oversampled gabor transforms, representation and approximation of time - varying systems via the rdgts. the experimental results show the efficiency and advantages of the rdgts in applications

    研究了基於實值離散gabor變換的瞬變信號表示演算法、基於過抽樣實值離散gabor變換的核磁共振fid信號增強演算法以及基於實值離散gabor變換的線性時變系統表示與逼近方法，實驗結果驗證了實值離散gabor變換在應用方面的優越性和有效性。
  5. Scalable video coding ( such as mpeg - 4 fgs and jvt svc ) and streaming is one of the most promising technologies. in this thesis, we investigate the key problem of scalable video coding and streaming : rate - distortion analysis and approximation, with which we also design some simple and effective smooth quality reconstruction algorithms of video streaming

    本文主要的內容和創新點包括:由於廣義高斯分佈ggd （ generalizedgaussiandistribution ）的高度靈活性，理論上和實際中它都可以非常好地描述離散餘弦變換（ dct ）和小波變換（ wavelettransform ）的編碼系數（ transformcoefficients ） 。
  6. On the basis of analyzing the several traditional algorithms, the efficient design method, the self - initiated weighted least squares ( swls ) combined with adaptive simulated annealing ( asa ), are proposed explicitly for the design of pif. this chebyshev criterion based optimal approximation method has not only very fast computing speed but also high accuracy and good controllability

    在對這些演算法特性分析比較的基礎上，系統完整地提出適用於lcos投影分合色偏振干涉濾光片設計的最高效方法? ?自啟動權值最小二乘演算法（ swls ）結合自適應模擬退火演算法（ asa ） 。
  7. Users of the preliminary edition ( now out of print ) will be interested to note several new chapters on complexity theory : chapter 8 on space complexity ; chapter 9 on provable intractability, and chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing

    早期版本的讀者將驚奇的發現新增的有關復雜性理論的章節：第8章，空間復雜性；第9章，不可證明性；第10章，高級話題，包括近似演算法，交替，交互推理系統，密碼學和并行計算。
  8. Compared with the multi - unit approaches, maximum nongaussinity estimation is superiror in simple theoretical foundation and flexible implementation, and thereof the popular fast fixed - point iteration ( fastica ) based on negentropy approximation has become one of the most popular algorithms for ica

    和非線性去相關方法比較，最大非高斯估計的原理簡單、實現靈活，其中基於負熵近似的快速不動點演算法（ fastica ）已經成為當前最為流行的ica演算法之一。
  9. Based on the representation of interval rational bezier curves and surfaces and by a serial of mathematical transformation, the degree reductions of them are converted to those of polynomials with upper bounds, then several algorithms are presented, with linear programming and optimal approximation methods. by relaxation of some constrained conditions, approximation effects of some of them are further improved

    根據區間有理bezier曲線、曲面的特點，通過一系列數學變換，將其降階問題轉化為多項式的保上界降階逼近，再應用線性規劃和最優逼近方法求解，給出幾種逼近演算法，並探討通過約束不等式的鬆弛，進一步改進逼近效果。
  10. After giving the legendre polynomials approximation to parametric speed of the curve, the author gives the jacobi polynomials approximation to parametric speed with endpoints interpolation. from this, two algebraic offset approximation algorithms, which preserve the direction of normal, are derived

    給出了曲線參數速度的legendre多項式逼近，進一步給出了參數速度的插值區間端點的jacobi多項式逼近，由此導出了保持法矢平移方向的兩個等距代數有理逼近演算法
  11. 2 ) systematically introduced parameter estimation of distributed sources on the base of models, including the maximum likelihood estimate, least squares estimator, dspe, dispare, etc. 3 ) studied four low complexity algorithms : one order approximation, two point sources approximation, traditional beamforming and relax of parameter estimation

    2 ）在模型基礎上系統地介紹了已有分散式目標參數估計方法，包括最大似然與最小二乘演算法， dspe和dispare演算法等。 3 ）研究了四種低復雜度演算法：一階近似演算法、兩點近似的演算法、常規波束形成演算法和relax演算法，這些演算法都是次優演算法，但計算量小，具有實用價值。
  12. Firstly, samples are determined by experimental design methods and size optimization of the structures corresponding to the samples is executed with nastran. secondly, an approximation model ( surrogate model ) based on the samples is derived using kriging method. thirdly, the optimal locations of structural elements are found by genetic algorithms ( ga ) because genetic algorithms can find global optimal solutions of surrogate model easily

    基本思路是利用試驗設計法選取樣本點，並對樣本點對應的結構進行尺寸優化，然後根據樣本點和優化結果建立代理模型，再利用遺傳演算法求出設計變量最優解，進而得到結構最優解。
  13. The author ' s work gives new way, which is beneficial to real time interaction and can efficiently reduce computing time as well as data storage amount. these algorithms can find good use in numerical machining, robotics, form - position tolerance and computer graphics. ( 3 ) degree reduction for nurbs curves and surfaces by applying the theory of the best uniform approximation of chebyshev polynomials and the explicit matrix representation of nurbs curves, this thesis centers on the research of the explicit nearly best approximation of multi - degree reduction of nurbs curves

    以上關于等距曲線的幾何逼近與代數逼近的演算法改革了當前國際圖形界只能對基曲線沿法矢方向平移定距離的點作近似逼近的固定模式，創造了利於交互操作，能有效地減少計算量及數據存儲量的新方法，可在數控加工、浙江大學碩士學位論文機器人、形位公差學、計算機圖形學中獲得很好的應用（ 3 ） nurbs曲線曲面降階應用nurbs曲線的顯式矩陣表示及chebyshev多項式逼近理論，以實現nurbs曲線顯式一次性降多階的近似最佳逼近為目標進行了研究
  14. The underlying reason is that in order to achieve high approximation level with the smallest possible memory, they need rather complex techniques to maintain a sketch, along time dimension, by using some existing off - line clustering algorithms

    這種原因在於用盡量小的內存來獲得近似的k中值點時，通常需要復雜的運算來維護一個壓縮的「概要」 sketch結構。
  15. Using the conic function model local approximation, w. cdavidon ( 1980 ) proposed a class of iterative algorithms with modified matrix combining function value, furthermore under the theory d. c. sorensen has used local quadratic approximation method, then applying collinear scaling idea improving on the above algorithm and generalizing it, getting a class of collinear scaling algorithm, unifying former quasi - newton. in the paper, using local quadratic approximation method, the first, constructing the new collinear scaling gene, getting a class of the new collinear scaling algorithm with briefness and numerical stability, ., we discusses some properties of the algorithm and its local linear convergence, q - superlinear convergence and the whole convergence ; secondly we have made numerical experimentation and numerical analysis ; the last, we have done much discussion for collinear scaling idea and given the several new collinear scaling algorithm

    本文的工作就是基於局部二次逼近原理，首先通過構造新的共線調比因子，得到了一類新的更簡潔，數值穩定性更好的共線調比演算法，進而我們給出了本共線調比演算法的局部收斂性，全局收斂性以及演算法q -超線性速度的理論證明；其次，用經典的無約束優化五大考核函數就本共線調比演算法進行了數值試驗和數值分析；最後，就局部二次逼近思想，進行共線調比演算法思想進行更廣泛的討論，給出了幾個新共線調比演算法。
  16. Lastly, aiming at the poor results which all current algorithms do for directional textures, and cannot synthesis texture directly, aiming at the particularity of this kind of textures, we bring forward the conceptions of non frontal parallel textures and frontal parallel textures. by analyzing texture ' s direction through fourier spectrum, we introduce the conception of main direction, and solve the approximation value of texture ' s main direction by discrete approximated approach. by this way, we can synthesis indirectly simple structural non frontal parallel textures

    最後針對現有演算法對帶有方向的紋理合成效果差，無法直接合成紋理圖像的難點，本論文首先提出了非正平行紋理與正平行紋理的概念，分析了它們之間的內在聯系，引入了兩個角度參數來描述紋理的朝向，採用傅立葉頻譜法分析紋理的方向特性，並提出了紋理主方向的概念，本論文引入離散逼近的方法來求解出紋理主方向的近似值，這樣我們就能用一種間接的方法合成簡單的結構性非正平行紋理。
  17. In chapterl, we introduce basic concepts about scheduling, the worst - case ratio analysis of approximation algorithms, stochastic scheduling problem and classes of stochastic scheduling policies

    我們在第一章中首先介紹排序問題的基本概念，排序演算法的性能分析，以及隨機性排序問題及其排序策略。
  18. In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems, one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio, another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan, we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1. 6

    第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。
  19. In the rest of the thesis, we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems. in chapter 2, we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems

    在第二章至第五章中，我們分別研究了四個組合優化問題的近似演算法，並給出了它們的性能分析。
  20. These kinds of ? tronger ? algorithms do not need to retrieve correspondence and branching problems. the contour - spreading algorithm is proposed to calculate distance field quickly within the complexity 0 ( n ). the intermediate surface is generated by linear approximation, while in conventional methods, it is tiled between a designated layer of contours and the original lower slice or upper slice of contours

    和傳統方法比較，它們生成的曲面都是精確通過采樣點，但是對于中間曲面的生成（在有分枝問題和對應問題時）方式不同，傳統方式是指定中間層的位置，在中間層按一定方式生成一個輪廓線，然後分別與上下層進行曲面鑲嵌，而基於距離場技術的方法則是通過線性插值的方式來產生中間曲面。
分享友人
分享到 Line

分享到臉書