Firefinder是按照您输入搜索标准快速查找网页内容中相匹配的CSS或XPath选择符。
Firefinder is for quickly finding web page elements that match CSS or Xpath selectors that you input as your search criteria.
虽然搜索引擎的风格和形式多种多样，但它们几乎全都使用基于词汇的索引方式来快速定位匹配项。
Search engines come in many flavors and forms, but almost all use some form of term-based indexing to rapidly locate matches.
提出一种能自适应的确定相关匹配搜索范围的快速相关跟踪算法。
A fast correlation tracking algorithm which can adaptively determine the search range in correlation matching is proposed.
“快速替换”可以在打开进行编辑的文档中或在当前项目中包含的文档中匹配或替换搜索字符串或表达式。
Quick replace to match or replace search strings or expressions in documents open for editing or contained in the current project.
提出了基于多尺度匹配的快速分形块编码，该方法为缩短分形编码的搜索时间提供了一条新途径。
A quick fractal block coding based on multiscale matching is presented in this paper. It provides a new approach for reducing search time.
该文提出了一种新的快速块匹配运动估计算法，即自适应十字模式搜索。
This paper proposes an adaptive rood pattern search, a new fast block-matching motion estimation algorithm.
提出了一种快速灰度图像彩色化算法，将图像像素邻域相关特性引入到匹配像素的搜索过程中。
We present a fast colorizing algorithm, which introduces the pixel neighborhood relativity into the search procedure for the matched pixels.
该算法结合“足够好就停止搜索”的思想和六边形搜索模式的高速特性，能快速找到匹配点。
The proposed algorithm takes advantages of "stop when good enough" spirit and high speedup gain of hexagon-based search pattern (HEXBS) to find suited points quickly.
针对目前图像处理中模板匹配方法一般具有较大计算量的不足，提出使用遗传算法进行快速的搜索。
Many template matching approaches in current image processing literatures are not practical because of their time consuming and complicated computation.
在对现有的搜索算法进行分析的基础上，提出了一种改进的快速块匹配算法——三重十字形搜索算法。
After analyzing some classical motion estimation algorithm, a new fast matching algorithm-Triple Cross Search is proposed.
陷入局部最优是快速块匹配算法的固有缺陷，为了减少陷入局部最优的概率，详细讲述了块像素匹配的搜索模板与搜索步骤。
Local minimum is one of the inherent problems of block based matching. In order to reduce the chance of falling into this problem, the improved search templates and searching steps are introduced.
算法选择了快捷和更为准确的搜索路径，且对程序的实现技术作了有效改进，其最终匹配结果具有全匹配算法的精度和典型快速算法的速度。
The speed of it can be compared with typical fast algorithm and the quality of it can be compared with the exhaustive searching algorithm.
在预匹配过程中，由于地磁数据的离散性，搜索步长定为一个基本网格单元，并与序贯相似检测原则相结合，这样可快速排除非匹配区，筛选得到精匹配所需要的可行区域。
In pre-matching, the searching strategy defines a gridding unit as a step with SSDA method, so it can quickly eliminate non-matching area and gain feasible area for precise-matching.
在预匹配过程中，由于地磁数据的离散性，搜索步长定为一个基本网格单元，并与序贯相似检测原则相结合，这样可快速排除非匹配区，筛选得到精匹配所需要的可行区域。
In pre-matching, the searching strategy defines a gridding unit as a step with SSDA method, so it can quickly eliminate non-matching area and gain feasible area for precise-matching.
应用推荐