Description: 针对小波变换和多级树集合分裂图像编码具有浮点数运算、算法复杂等特点,采用整数实现的提升格式代替了原来的小
波变换,并结合提升小波变换和DCT变换的特点,提出了一种改进方案。-For wavelet transform and multi-level set to split the tree image coding with floating-point computation, algorithmic complexity, etc., realize the upgrading of the use of integer format instead of the original wavelet transform, combined with lifting wavelet transform and DCT transform, an improved program. Platform: |
Size: 287744 |
Author:jingjing |
Hits:
Description: 设计模式, the STL has iterators, algorithms, and function objects, but for most C++
programmers, it s the containers that stand out. More powerful and flexible than arrays,
they grow (and often shrink) dynamically, manage their own memory, keep track of
how many objects they hold, bound the algorithmic complexity of the operations they
support, and much, much more. Their popularity is easy to understand. They re simply
better than their competition, regardless of whether that competition comes from
containers in other libraries or is a container type you d write yourself. STL containers
aren t just good. They re really good.-effective STL Platform: |
Size: 44821504 |
Author:朱 |
Hits:
Description: Sure, the STL has iterators, algorithms, and function objects, but for most C++ programmers, it s the containers that stand out. More powerful and flexible than arrays, they grow (and often shrink) dynamically, manage their own memory, keep track of how many objects they hold, bound the algorithmic complexity of the operations they support, and much, much more. Their popularity is easy to understand. They re simply better than their competition, regardless of whether that competition comes from containers in other libraries or is a container type you d write yourself. STL containers aren t just good. They re really good. Platform: |
Size: 1233920 |
Author:searcher |
Hits:
Description: 该源码实现对时间序列进行算法复杂性计算，近似熵计算等功能。-computes the algorithmic complexity on the time series，the approximate entropy that measures the
so-called "pattern similarity" in a given time series and so on. Platform: |
Size: 14336 |
Author:王丽 |
Hits:
Description: in Multiuser Multicarrier Wireless Systems
Wong, Ian C., Evans, Brian
2008, XVIII, 122 p., Hardcover
ISBN: 978-0-387-74944-0
Resource Allocation in Multiuser Multicarrier Wireless Systems proposes a unified algorithmic framework based on dual optimization techniques that have complexities that are linear in the number of subcarriers and users, and that achieve negligible optimality gaps in standards-based numerical simulations. Adaptive algorithms based on stochastic approximation techniques are also proposed, which are shown to achieve similar performance with even much lower complexity
Platform: |
Size: 1701888 |
Author:moddyy |
Hits:
Description: 算法导论第三版，介绍了很多关于复杂度、算法思想、伪代码等等很多算法基础知识，是初学算法的必备好书。-Introduction to Algorithms, Third Edition, describes a lot about complexity, algorithmic thinking, pseudo code algorithm basics. It is an essential good book for beginner to learn algorithm. Platform: |
Size: 5098496 |
Author:lsj |
Hits:
Description: the STL has iterators, algorithms, and function objects, but for most C++
programmers, it s the containers that stand out. More powerful and flexible than arrays,
they grow (and often shrink) dynamically, manage their own memory, keep track of
how many objects they hold, bound the algorithmic complexity of the operations they support, and much, much more. Their popularity is easy to understand.-the STL has iterators, algorithms, and function objects, but for most C++
programmers, it s the containers that stand out. More powerful and flexible than arrays,
they grow (and often shrink) dynamically, manage their own memory, keep track of how many objects they hold, bound the algorithmic complexity of the operations they support, and much, much more. Their popularity is easy to understand. Platform: |
Size: 1305600 |
Author:liaoruihui |
Hits:
Description: 算法设计与分析
排序算法实验报告
1、实验步骤和要求：
（1）分别设计并实现插入排序、合并排序、快速排序的算法。
（2）设计测试数据集，编写测试程序，用于测试正确性、算法复杂性（最好情况、最坏情况、平均情况）、效率。-Algorithm design and analysis lab report a sorting algorithm, experimental procedures and requirements: (1) were designed and implemented insertion sort, merge sort, quick sort algorithm. (2) design of test data sets, writing test procedures for testing the correctness of algorithmic complexity (best case, worst case, average case), the efficiency. Platform: |
Size: 28672 |
Author: |
Hits:
Description: programmers, it s the containers that stand out. More powerful and flexible than arrays,
they grow (and often shrink) dynamically, manage their own memory, keep track of
how many objects they hold, bound the algorithmic complexity of the operations they
support, and much, much more. Their popularity is easy to understand. They re simply
better than their competition, regardless of whether that competition comes from
containers in other libraries or is a container type you d write yourself. STL containers
aren t just good. They re really good. Platform: |
Size: 277504 |
Author:V |
Hits:
Description: Poisson surface reconstruction creates watertight surfaces from oriented
point sets. In this work we extend the technique to explicitly incorporate
the points as interpolation constraints. The extension can be interpreted as
a generalization of the underlying mathematical framework to a screened
Poisson equation. In contrast to other image and geometry processing
techniques, the screening term is defined over a sparse set of points rather
than over the full domain. We show that these sparse constraints can
nonetheless be integrated efficiently. Because the modified linear system
retains the same finite-element discretization, the sparsity structure is
unchanged, and the system can still be solved using a multigrid approach.
Moreover we present several algorithmic improvements that together
reduce the time complexity of the solver to linear in the number of points,
thereby enabling faster, higher-quality surface reconstructions. Platform: |
Size: 163840 |
Author:青竹居士 |
Hits:
Description: 算法问题，将两个已知的降序链表，合并成一个升序链表，时间空间复杂度均为线性。-Algorithmic problems, the two known descending list, merged into a linked list in ascending order, are linear time and space complexity. Platform: |
Size: 60416 |
Author:光脚的狼 |
Hits:
Description: 机器学习(Machine Learning, ML)是一门多领域交叉学科，涉及概率论、统计学、逼近论、凸分析、算法复杂度理论等多门学科。专门研究计算机怎样模拟或实现人类的学习行为，以获取新的知识或技能，重新组织已有的知识结构使之不断改善自身的性能(Machine learning (Machine Learning ML) is an interdisciplinary subject, involving probability and statistics, approximation theory, convex analysis, complexity theory and other disciplines. Devoted to the study of how computer simulation or the realization of human learning, to acquire new knowledge or skills, knowledge structure has been reorganized to continually improve their performance) Platform: |
Size: 41856000 |
Author:HaroldSYSZ
|
Hits:
Search - algorithmic complexity