搜索资源列表
1
- LDPC码译码相关文献 Bounds on the maximum likelihood decoding error probability of low density parity check codes
newMIMOrelay
- 两篇最新的介绍MIMO中继信道容量的文章Capacity Bounds for Gaussian MIMO relay channel with Channel State Information 与 Amplify-Forward and Decode-Forward The Impact of Location and Capacity Contour-2, introduced the latest MIMO channel capacity relay article Capacity
boundsonLDPCandLDGM
- The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. T
LJDBSearch(1)
- 数据库管理系统存储的一般都是结构化数据，长足于数值的计算、查询、统计与挖掘。随着计算机存储与计算能力的迅猛发展，越来越多的非结构化文本数据存储在数据库中，数据库中的文本搜索日益广泛。 当前，数据库中的文本搜索，一般采用SQL语句中的Like操作符或者采用数据库系统自带的全文索引功能。Like操作往往特别耗时，数据规模超过10万条，查询往往会导致网络连接超时，无法满足在线搜索的需要；同时，Like查询仅仅是简单的字符串匹配，没有考虑语言语义，检索“和服”，同样会命中“产品和服务”。当前
Numega.BoundsChecker.v6.5.Delphi.Edition
- Bounds checks help us check stability -Bounds checks
1234
- 2010最新的用分枝界限法解决最大多样性问题的SCI论文。-This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the
Client
- This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance P
space-time-block-coding
- An adaptive transmit diversity scheme with quadrant phase constraining feedback is proposed in this paper. With simple linear operations at both transmitter and receiver, the proposed algorithm can achieve better system performances with only 2M
ruanjianceshi
- 软件测试所有可能遇到的试题大全，并且附有详解答案，相信有了它，你的软件测试能力会突飞猛进。-Software to test all the questions you may encounter Guinness, and attached Detailed answer, I believe With it, your software testing capabilities by leaps and bounds.
AAMAS10-dcop-approximation
- Asynchronous Algorithms for Approximate Distributed Constraint Optimization with Quality Bounds
coredump
- 日常coredump分析 比如：段错误（segmentation fault）、空指针、野指针、堆栈越界、栈溢出 -Daily coredump analysis: segfault (segmentation fault), null pointer and wild pointer, stack out of bounds, stack overflow
star_tree_allerton
- We consider the problem of grooming traffic in WDM star and tree networks to minimize equipment cost. We prove an important result regarding wavelength assignment in both topologies. We present a series of lower and upper bounds on the optimal so
16c5xbc
- 16c5xbc单片机的开发技术实例，很好的软件入门学习资料，能让你一日千里！-Microcontroller development technology 16c5xbc instance, good the Software Starter learning information, you leaps and bounds!
the-art-of-computer-program
- 谈谈我自己读这套书的心得。抛砖引玉。 首先要清楚这套书的定位：它是古典的算法分析的工具书。 1.古典（classic）体现在模型和问题上。 模型就是顺序算法（sequential algorithms）的经典模型。大名鼎鼎的MIX并非是个程序设计语言这么简单，而是一个计算模型：即标准指令集RAM。这是个非常经典，也是非常符合现实的上界（upper bounds）模型。 该书涉及到的问题是计算机科学诞生之初就自然面对-Talk about my own experience
122
- 对 -方法导出的几种隐式差分格式编程实现求出数值解；估计数值解的误差界；大致比较几种不同格式的优劣；结合格式的相容性、稳定性和收敛性条件简单分析计算结果-- Export several implicit difference scheme for programming to find the numerical solution estimated error bounds for the numerical solution rough comparison of the pros a
This-paper-addresses-bounds-on-the-t
- 主网络和认知网络供存在同一地理环境共享同一频谱，研究了网络的4重容量界限-This paper addresses bounds on the transmission capacities of two coexisting wireless networks (a primary and a secondary network), where each with multiple antennas shares the same spectrum and operates in
QuickSort
- 快速排序之所比较快，因为相比冒泡排序，每次交换是跳跃式的。每次排序的时候设置一个基准点，将小于等于基准点的数全部放到基准点的左边，将大于等于基准点的数全部放到基准点的右边。这样在每次交换的时候就不会像冒泡排序一样每次只能在相邻的数之间进行交换，交换的距离就大的多了。因此总的比较和交换次数就少了，速度自然就提高了。-Quick sort of the relatively fast, as compared to bubble sort, each exchange is leaps and bo
Conditional-diagnosability-of-alternating-group-n
- The growing size of a multiprocessor system increases its vulnerability to component failures. In order to maintain the system’s high reliability, it is crucial to identify and replace the faulty processors through testing, a process known as fau
Chapter_4_-_Cramer_Rao_Lower_Bounds_for_Nonlinear
- Cramer Rao Lower Bounds for Nonlinear Filtering
JSIP_2013081510281570
- This paper investigates the generalized Pars ’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Pars ’s theorem reduces to an inequality with lower and upper bounds associated wit