Log in

Relevant bibliographies by topics / Fast search / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Fast search.

Dissertations / Theses on the topic 'Fast search'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Fast search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Vassef, Hooman. "Combining fast search and learning for scalable similarity search." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86566.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.<br>Includes bibliographical references (leaves 38-39).<br>by Hooman Vassef.<br>S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

2

Schlieder, Torsten. "Fast similarity search in XML data." [S.l.] : [s.n.], 2003. http://www.diss.fu-berlin.de/2003/108/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kibriya, Ashraf Masood. "Fast Algorithms for Nearest Neighbour Search." The University of Waikato, 2007. http://hdl.handle.net/10289/2463.

Full text

Abstract:

The nearest neighbour problem is of practical significance in a number of fields. Often we are interested in finding an object near to a given query object. The problem is old, and a large number of solutions have been proposed for it in the literature. However, it remains the case that even the most popular of the techniques proposed for its solution have not been compared against each other. Also, many techniques, including the old and popular ones, can be implemented in a number of ways, and often the different implementations of a technique have not been thoroughly compared either. This

APA, Harvard, Vancouver, ISO, and other styles

4

Chung, Hing-yip Ronald, and 鍾興業. "Fast motion estimation with search center prediction." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31220721.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Soongsathitanon, Somphob. "Fast search algorithms for digital video coding." Thesis, University of Newcastle Upon Tyne, 2004. http://hdl.handle.net/10443/1003.

Full text

Abstract:

Motion Estimation algorithm is one of the important issues in video coding standards such as ISO MPEG-1/2 and ITU-T H.263. These international standards regularly use a conventional Full Search (FS) Algorithm to estimate the motion of pixels between pairs of image blocks. Since a FS method requires intensive computations and the distortion function needs to be evaluated many times for each target block. the process is very time consuming. To alleviate this acute problem, new search algorithms, Orthogonal Logarithmic Search (OLS) and Diagonal Logarithmic Search (DLS), have been designed and imp

APA, Harvard, Vancouver, ISO, and other styles

6

Nelson, Jelani (Jelani Osei). "External-memory search trees with fast insertions." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37084.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 65-68).<br>This thesis provides both experimental and theoretical contributions regarding external-memory dynamic search trees with fast insertions. The first contribution is the implementation of the buffered repository B-tree, a data structure that provably outperforms B-trees for updates at the cost of a constant factor decrease in query performance. This thesis also describes the cache-oblivious lookahead array, which outperforms B-

APA, Harvard, Vancouver, ISO, and other styles

7

Minz, Ian. "Modeling cooperative gene regulation using Fast Orthogonal Search." Thesis, Kingston, Ont. : [s.n.], 2008. http://hdl.handle.net/1974/1364.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Begin, Steve. "A search for fast pulsars in globular clusters." Thesis, Link to full text, 2006. http://hdl.handle.net/2429/69.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wang, Huan-sheng. "Fast search techniques for video motion estimation and vector quantization." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/13918.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kauffman, Kyle J. "Fast target tracking technique for synthetic aperture radars." Oxford, Ohio : Miami University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=miami1250263416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Hazell, Georgina Grace Joan. "Deorphanising G protein-coupled receptors : the search for fast steroid receptors." Thesis, University of Bristol, 2011. http://hdl.handle.net/1983/12fbf473-f360-4831-8123-42698aff4950.

Full text

Abstract:

G protein coupled receptors (GPCRs) are the largest family of transmembrane receptors in the genome and are activated by a multitude of ligands including neuropeptides, hormones and sensory signals. The paraventricular nucleus (PVN) and supraoptic nucleus (SON) of the hypothalamus are important mediators in homeostatic control. Many modulators of PVN/SON activity, including neurotransmitters and hormones act via GPCRs - in fact over 100 non-chemosensory GPCRs have been detected in either the PVN or SON. The introduction to this thesis begins with a comprehensive summary of GPCR expression with

APA, Harvard, Vancouver, ISO, and other styles

12

Liu, Rongzhi Barish Barry C. Barish Barry C. Peck Charles W. "A search for fast moving magnetic monopoles with the MACRO detector /." Diss., Pasadena, Calif. : California Institute of Technology, 1995. http://resolver.caltech.edu/CaltechETD:etd-10232007-094957.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Zellweger, Tobias. "The Dark Side of Fast Fashion - : In Search of Consumers’ Rationale Behind the Continued Consumption of Fast Fashion." Thesis, Stockholms universitet, Företagsekonomiska institutionen, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-145014.

Full text

Abstract:

This study investigates the underlying rationale of environmentally and socially conscious young Swedish consumers for their continued consumption of fast fashion. Furthermore this study assesses influential factors that shape young Swedish consumers’ attitudes and beliefs towards fast fashion. The fast fashion business model is largely based on the exploitation of poor working conditions and lack of environmental protection laws in the production countries. However, consumers are becoming increasingly aware of this dark side of fast fashion and the retailers are addressing their concerns with

APA, Harvard, Vancouver, ISO, and other styles

14

FU, Jing-wei, and 傅敬惟. "Fast Hexagon Search Algorithm." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/37928024863874686575.

Full text

Abstract:

碩士<br>國立屏東商業技術學院<br>資訊工程系(原資訊科技系)<br>97<br>Motion vector searching is the key issue for video compression. Many studies are proposed for rising video quality and reducing search points. This paper is based on the point of view that most of motion vectors are very short and not far from (0,0) . The new algorithm that based on Hexagon-Based Search Algorithm and Diamond Search Algorithm is proposed, it has less search point and better video quality than other algorithms.

APA, Harvard, Vancouver, ISO, and other styles

15

Chang, Alan, and 張哲維. "Fast Similarity Search in String Databases." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/98631286343899640374.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>93<br>Efficient similarity search in large string databases requires effective index support. Since long strings have each numerous substrings of arbitrary length, the effective index designs are of great challenge. The existing solution, namely MRS [11], employs a low-cost lower bound function to sieve out the most similar candidates from the majority of unlikely database substrings. Therefore, only very small portions of string databases require the expensive true edit distance computation to finalize the query. A significant savings in overall query processing cost

APA, Harvard, Vancouver, ISO, and other styles

16

Cakir, Fatih. "Online hashing for fast similarity search." Thesis, 2017. https://hdl.handle.net/2144/27360.

Full text

Abstract:

In this thesis, the problem of online adaptive hashing for fast similarity search is studied. Similarity search is a central problem in many computer vision applications. The ever-growing size of available data collections and the increasing usage of high-dimensional representations in describing data have increased the computational cost of performing similarity search, requiring search strategies that can explore such collections in an efficient and effective manner. One promising family of approaches is based on hashing, in which the goal is to map the data into the Hamming space where fas

APA, Harvard, Vancouver, ISO, and other styles

17

Wang, Po-chung, and 王柏忠. "Fast Pattern Classification through Nearest-Neighbor Search." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/46937856524916401924.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>98<br>Over recent years, support vector machines (SVMs) have been widely used for solving a variety of classification problems in the fields of pattern recognition and data mining applications. One basic principle behind SVMs is to predict the class label of a testing sample by using the optimal hyperplane determined from labeled training samples. Obviously, this principle brings SVMs a limitation that they are computationally infeasible for training a very large-scale dataset. To overcome this drawback, an intuitive approach is to reduce the number of training

APA, Harvard, Vancouver, ISO, and other styles

18

Lee, Shang-Ju, and 李尚儒. "A Novel Algorithm for Fast Codebook Search." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/47491812853646618150.

Full text

Abstract:

碩士<br>國立交通大學<br>電控工程系所<br>98<br>In this thesis, we propose an algorithm to reduce the complexity to search the most suitable codeword for a given codebook. It is proven in the thesis that about half codewords are eliminated in each iteration. In addition, we derive two lower bounds for the proposed algorithm and show that they reach the actual SNR loss in high resolution codebook. Furthermore, the complexity analysis and simulations are given to see that the advantages of taking this algorithm are revealed in the scenario of large codebook size.

APA, Harvard, Vancouver, ISO, and other styles

19

Kuo, Ching-Lin, and 郭景林. "Fast Codeword Search Techniques for Vector Quantization." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/71639511911627628887.

Full text

Abstract:

碩士<br>國立中正大學<br>資訊工程學系<br>84<br>In this thesis, we propose two fast codeword search techniques for vector quantization. One is the closest-paired tree-structured vector quantization (CPTSVQ), and the other is the double test equal-average nearest neighbor search (DTENNS) algorithm. The CPTSVQ is a kind of tree- structured vector quantization (TSVQ). In CPTSVQ, the closest-pair technique is used to enlarge the search range of the multipath search alg

APA, Harvard, Vancouver, ISO, and other styles

20

Chen, Yong-Sheng, and 陳永昇. "Fast Algorithms for Block Matching, Nearest Neighbor Search, and DNA Sequence Search." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/14512640917239947049.

Full text

Abstract:

博士<br>國立臺灣大學<br>資訊工程學研究所<br>89<br>Template matching has been widely used in image and video compression, visual tracking, stereo vision, pattern classification, object recognition, and information retrieval in database systems. Among the major difficulties of template matching is its high computational cost when dealing with large amount of data. In this thesis we propose techniques that can greatly improve the computational efficiency of template matching while still guaranteeing the optimal search. These techniques are applied to speed up the applications of block matching, nearest neighbor

APA, Harvard, Vancouver, ISO, and other styles

21

Bégin, Steve. "A search for fast pulsars in globular clusters." Thesis, 2006. http://hdl.handle.net/2429/17874.

Full text

Abstract:

Millisecond pulsars (MSP) are old neutron stars that have been spun up to high spin frequencies (as fast as 716 Hz) through the accretion of matter from a companion star. The extreme steller densities in the core of globular clusters creates numerous accreting neutron star systems through exchange interactions: this leads to the formation of MSPs in larger numbers than the galactic disk. Over the course of this project, we have collected over 17 TB of data on the 3 globular clusters M28 NGC6440 and NGC6441 plus 2 observations on NGC6522 and NGC6624 as part of the recently begun S-band survey u

APA, Harvard, Vancouver, ISO, and other styles

22

Chen, Jun-Ting, and 陳俊廷. "A HYBRID CANDIDATE SCHEME FOR FAST ACELP SEARCH." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/24759404532951137604.

Full text

Abstract:

碩士<br>大同大學<br>通訊工程研究所<br>93<br>A manner of speech coding could be said to come over a series of advances and replacement of technology; and all of these are just for the perfect compatibility or trade-off between the finite resource and the marketing request; and the finite resource is usually closely related to system computational complexity. For an example of ACELP speech codec mode, a huge amount of computations are concentrated in the part of codebook search. Therefore, how to do a fast and accurate search on algebraic codebook becomes very important; and this is the main propose for this

APA, Harvard, Vancouver, ISO, and other styles

23

Wang, Wen-Chin, and 王文祺. "AN IMPROVED CANDIDATE SCHEME FOR FAST ACELP SEARCH." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/19280679835777081194.

Full text

Abstract:

碩士<br>大同大學<br>電機工程研究所<br>91<br>In the era of third-generation (3G) wireless personal communications, though applications of multimedia such as video and data communication have become more and more popular, speech communication is still one of the most important mobile radio services. The ACELP algorithm is based on the Code-Excited Linear-Prediction (CELP) coding model. The ACELP (algebraic code excited linear prediction) algorithm has been adopted by many speech coding standards due to its high speech quality and inherent robustness to channel noise. But in the full search, it need 8192 oper

APA, Harvard, Vancouver, ISO, and other styles

24

Chang, Ming-Che, and 張銘哲. "Adaptive Cross Search for Fast Motion Estimation Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/su6hj9.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>96<br>When digital video data are stored in storage devices or transmitted in communication channel, it requires huge space of storage or occupies wide transmission bandwidth. This results in the great development and demand in video compression standards like MPEG-1, MPEG-2, MPEG-4, H.261, H.263, and H.264, etc. Motion estimation plays a very important role in video data compression system. Its main goal is to find out the similar data between neighbor video frames so as to reduce the temporal redundancy in video frames. Therefore, the accuracy of motion estima

APA, Harvard, Vancouver, ISO, and other styles

25

Chang, Shun-Chieh, and 張舜傑. "The Research of VQ-Based Fast Search Algorithm." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/k7gsrf.

Full text

Abstract:

博士<br>國立臺北科技大學<br>電機工程系博士班<br>100<br>This dissertation proposes a fast search algorithm for vector quantization (VQ) based on a fast locating method, and uses learning and trade-off analysis to implement this algorithm. The proposed algorithm is a binary search space VQ (BSS-VQ) that determines a search subspace by binary search in each dimension, and the full search VQ (FSVQ) or partial distance elimination (PDE) is subsequently used to obtain the best-matched codeword. In trade-off analysis, a slight loss occurred in quantization quality; however, a substantial computational saving was achie

APA, Harvard, Vancouver, ISO, and other styles

26

Chou, Tung, and 周彤. "Fast Exhaustive Search for Polynomial Systems over F2." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/72472312199039751567.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Jhao, Bin-Cheng, and 趙斌成. "Fast predictive search algorithm for video motion estimation." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/43132089826832406542.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Liang, Wong Mu, and 王木良. "Fast codebook search schemes in CELP speech coder." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/33258578647155591386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Liu, Shen-hsien, and 劉昇顯. "Enhanced zero-block decision with fast motion search." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/12068245007983493901.

Full text

Abstract:

碩士<br>國立中央大學<br>通訊工程研究所碩士在職專班<br>98<br>H.264/AVC is the latest video coding standard. In order to achieve the highest coding efficiency, H.264 adopts complicated coding schemes, employing motion compensation with variable blocks sizes motion estimation, multiple reference frames motion estimation, de-blocking filter and integer transform, etc. Unfortunately, these features incur a considerable increase in encoder complexity, mainly regards to mode decision and motion estimation. In this paper, we first review the characteristics of zero blocks and ZBD (zero-block mode decision) algorithm,

APA, Harvard, Vancouver, ISO, and other styles

30

Hsieh, Yen-Chou, and 謝衍州. "Fast Packet Classification Based on Binary Prefix Search." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/36065667203365441311.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>92<br>Fast packet classification is required for the increasing traffic demand because of the rapid growth of the Internet. Packet classification is often the first packet processing step in routers. Because of the complexity of the matching algorithms, packet classification is often a bottleneck in the performance of the network infrastructure. Most of the algorithmic solutions don’t scale very well. In this thesis, we proposed a novel packet classification algorithm based on the binary prefix search. The data structure of a d-dimensional rule table is converted

APA, Harvard, Vancouver, ISO, and other styles

31

Kuo, Chien-Liang, and 郭建良. "Fast Partial Codebook Search Algorithm for Vector Quantization." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/91097170823278569147.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>91<br>In this thesis, we propose two methods which base on mean-sorted method , to filter the impossible codeword in advance, expecting to reduce the times of the calculation of Euclidean Distance in the Encoding times.In these algorithms,we choice different projection masks for each codeword by it''s pixels value, and store in the Codebook;Or after producing the codebook , producing a unique projection mask for each codeword according to it''s distribution of pixels value.When compressing,take out the previous records, and set these on the codeword and source vec

APA, Harvard, Vancouver, ISO, and other styles

32

Wang, Shu-Yen, and 王書彥. "Fast Cellular Search Algorithm for Block-Matching Estimation." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/22435183367158286304.

Full text

Abstract:

碩士<br>長庚大學<br>電機工程研究所<br>91<br>The multimedia data which includes image, audio and video is more and more larger with accompanying the progress of digital technology and the development of internet. When digital video data are stored in storage devices or transmitted in communication channel, it requires huge space of storage or occupies wide transmission bandwidth. Therefore, the motion estimation takes an important role in video coder that has a big influence on the performance of a video coding system. In general, the motion field of the current block can be tracked from the motion fields o

APA, Harvard, Vancouver, ISO, and other styles

33

HUANG, SAN-YI, and 黃三益. "Dynamic bucketing:a data structure for fast range search." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/00446121402221182975.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

XIE, WAN-MING, and 謝萬明. "Fast algorithms for VQ codebook design and search." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/16068615464186125222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Wang, Wei-Jeng, and 王偉政. "Fast Exhaustive Search for Polynomial Systems over F3." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/49431959255690879055.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電子工程學研究所<br>104<br>Solving multivariate polynomial systems over finite fields is an important problem in cryptography. For random F2 low-degree systems with equally many variables and equations, enumeration is more efficient than advanced solvers for all practical problem sizes. Whether there are others remained an open problem. We here study and propose an exhaustive-search algorithm for low-degree systems over F3 which is suitable for parallelization. We implemented it on Graphic Processing Units (GPUs) and commodity CPUs. Its optimizations and differences from the F2 case ar

APA, Harvard, Vancouver, ISO, and other styles

36

Awekar, Amit Chintamani. "Fast, incremental, and scalable all pairs similarity search." 2009. http://www.lib.ncsu.edu/theses/available/etd-12022009-094010/unrestricted/etd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Yeh, Chien-hsing, and 葉建興. "A Fast Quantum Search Algorithm and its Application." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/93712296814320678370.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>電子工程系<br>95<br>Quantum computation and quantum information science, which combine the exploration of quantum mechanics and new physical principals, have been a promise for solving complicated problems that are not tractable by conventional computers. In this thesis, we consider quantum search algorithms to search the minimum in an unordered database of N items. Traditionally, the running time required to locate the minimum is O(N) steps. To alleviate the computational load, various quantum search algorithm of complexity O(N^{1/2}) have been addressed. This thesis presents tw

APA, Harvard, Vancouver, ISO, and other styles

38

Yang, Kuan-Hua, and 楊冠華. "Fast No Search Fractal Coding for Color Images." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/14825267229564404808.

Full text

Abstract:

碩士<br>大同大學<br>通訊工程研究所<br>93<br>The fractal image coding has been used in many image processing applications in recent years. In the fractal image coding, most of the time is spent on searching the best matching domain block and the parameters of the transform function. If we want to transmit an image in the internet or store it in some devices, it is desirable to achieve fast fractal encoding. In this thesis, fast no search fractal coding methods for color images are proposed which are able to speed up the encoding time and maintain the image fidelity. Based on iterated function system (IFS) a

APA, Harvard, Vancouver, ISO, and other styles

39

Lu, Chih-Te, and 盧志德. "Multiview Encoder Parallelized Fast Search Realization on NVIDIA CUDA." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/vdd5k4.

Full text

Abstract:

碩士<br>國立臺北科技大學<br>資訊工程系研究所<br>98<br>Due to the rapid growth of the graphics processing unit (GPU) processing capability, it gets more and more popular to use it for non-graphics computations. NVIDIA announced a powerful GPU architecture called Compute Unified Device Architecture (CUDA) in 2007, which is able to provide massive data parallelism under the SIMD architecture constraint. We use NVIDIA GTX-280 GPU system, which has 240 computing cores, as the platform to implement a very complicated video coding scheme. The Multiview Video Coding (MVC) scheme, an extension of H.264/AVC/MPEG-4 Part 1

APA, Harvard, Vancouver, ISO, and other styles

40

Chen, Ching-Hsien, and 陳慶賢. "A FAST SEARCH METHOD FOR TEXT-INDEPENDENT SPEAKER IDENTIFICATION." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/67036281586403630746.

Full text

Abstract:

碩士<br>大同工學院<br>電機工程學系<br>84<br>The major problem in text-independent speaker identification is how to enhance the inter-speaker variances and decrease the intra-speaker variances. Once these problems can be solved, we can develop speaker identification systemwith wish identfication rate. To achieve the goals, there are two need, one is to find the appropriate feature of speech signals, and the other is to define a good distance measure. In practice, a large amount of speech data

APA, Harvard, Vancouver, ISO, and other styles

41

Lue, Chien Chih, and 呂建志. "A Fast Search Algorithm for Vector Quantization Codebook Generation." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/16664514047637526747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Lo, Wei-En, and 羅偉恩. "Fast Binary Search Packet Classification Based On Decision Trees." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/19616735166327089505.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>96<br>With the rapid growth of internet requirement and the occurrence of network applications, backbone routers nowadays need to classify packets into flows in a short time. In this paper, we propose a new algorithm called fast binary search packet classification to improve the efficiency on both search speed and the memory storage. In our algorithm, we first partition the filter table with decision tree but process a binary search on leaf nodes instead of the traditional tree traversal. We use a hash- based bit selecting strategy to replace the range cutting met

APA, Harvard, Vancouver, ISO, and other styles

43

Chiang, Yen-Hwa, and 江彥樺. "Fast Search Algorithms for Motion Estimation in Video Coding." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/90762676497159516837.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>93<br>Due to the great development and demand in video compression standards like MPEG-1, MPEG-2, MPEG-4, H.261, H.263, and H.264, etc, motion estimation is still an important part in the video coding schemes. Its main goal is trying to find out the motion vector and the difference of similarity between two successive pictures so as to reduce amount of redundant information in temporal domain and spatial domain to achieve data compression. Hence, a good motion estimation algorithm may influence the video quality of coding scheme very well. Another one important

APA, Harvard, Vancouver, ISO, and other styles

44

Chang, Ming-Ching, and 張明清. "Fast Search Algorithms for IC Printed Mark Quality Inspection." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/42532050550149009258.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊工程學系<br>86<br>This paper presents an effective and general purpose search algorithm for alignment, and we applied it to IC printed mark quality inspection. The search procedure is based on normalized cross correlation, and we improve the method with hierarchical resolution pyramid, dynamic programming, subpixel accuracy, multiple target search, and automatic model selection. The proposed search method can be applied to general visual inspection. The IC printed mark includ

APA, Harvard, Vancouver, ISO, and other styles

45

Chen, Ho-Shun, and 陳河順. "A Fast Search Method for Table-based Sphere Decoding." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/89535828362536667778.

Full text

Abstract:

碩士<br>國立交通大學<br>電機工程學系<br>101<br>In this thesis, we propose 3 enumeration methods based on the concentric property of QAM modulation and the tabular enumeration. The first is a complexity-reduced enumeration which separates constellation points into several concentric circles. The candidate nodes are enumerated from inner to outer circles following the decision rules. The second method is an extension of tabular enumeration which we expand the enumeration tables by adopting the candidate sets to enlarge the selection range. For the implementation, we further simplify the proposed tables and sa

APA, Harvard, Vancouver, ISO, and other styles

46

CHIEH, CHUNG MING, and 鍾明潔. "An improvement of fast search algorithm for vector quantization." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/64771750684446335732.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Tsai, Chung-Wei, and 蔡鐘葳. "A Hexagon-Based Fast Search Algorithm for Motion Estimation." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/28355244015462725269.

Full text

Abstract:

碩士<br>南台科技大學<br>電子工程系<br>98<br>In video compression, motion estimation plays a key role for educing the complexity of the calculation. There are different impacts on the performance while using various search algorithms for motion estimation. Efficient algorithm can save more computing time and more search points. A rapid search algorithm using the principle of Hexagon-Based Search algorithm (HEXBS) for motion estimation called Hexagon-Based Fast Search algorithm (HEXFS) is proposed. The proposed algorithm combines the hexagon search algorithm and a two-step search algorithm which uses two cro

APA, Harvard, Vancouver, ISO, and other styles

48

Lee, Che-Wei, and 李哲瑋. "Double-layered Initial Search Pattern for Fast Motion Estimation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/94919139335258025914.

Full text

Abstract:

碩士<br>國立成功大學<br>電機工程學系碩博士班<br>93<br>Multimedia communication relies on data compression technologies to reduce the data bytes of transmission and enhance the speed of transmission. Motion estimation is vital to many motion-compensated video-coding techniques/standards, such as ISO MPEG-1/2/4 and ITU-T H.261/262/263/264。In block motion estimation, a search pattern with a different shape and size has a very important impact on performance of motion estimation. The performance indicates that the speed of finding out motion vectors and the visual quality of predicted results. In recent years, many

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Wei Yi, and 王偉一. "A Fast Local Search Algorithm for Virtual Network Embedding." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/66124207234591887052.

Full text

Abstract:

碩士<br>國立清華大學<br>通訊工程研究所<br>104<br>Network virtualization is a popular topic about providing next-generation Internet services. It primarily virtualizes the resources managed by the Infrastructure Provider (InP) and the demands claimed by the Service Provider (SP) to make the concepts of the resource allocation and the user isolation to be more clearly. We inspired by the insight of the pricing problem, so that we set the price of virtual requests on the objective function. Then we focuses on a relatively fast algorithm for solving the VNE than exact solutions. We propose the Permutation Swap M

APA, Harvard, Vancouver, ISO, and other styles

50

Wang, Ying-Chih, and 王穎智. "Fast Fractional Pixel Search Algorithm in H.264/AVC." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/35548902198281173606.

Full text

Abstract:

碩士<br>國立中央大學<br>通訊工程研究所<br>95<br>H.264/AVC is a new video compression coding standard, in which quarter resolution and motion compensation can achieve more accurate motion description. It means that we need more time to find the best condition. Therefore, reducing the computational complexity for fractional pixels is necessary and significant. We proposed a fast fractional pixel search algorithm using symmetric convex cup for half and quarter resolution. In any case (half and quarter resolution), we can roughly reduce 65%~78% of computation complexity compared to that in the reference software

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!