Academic literature on the topic 'Fast search algorithm'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fast search algorithm.'

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.

Journal articles on the topic "Fast search algorithm"

1

Soongsathitanon, S., W. L. Woo, and S. S. Dlay. "Fast search algorithms for video coding using orthogonal logarithmic search algorithm." IEEE Transactions on Consumer Electronics 51, no. 2 (2005): 552–59. http://dx.doi.org/10.1109/tce.2005.1468001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

A., V. Paramkusam, and Laxma Reddy D. "A Three-Point Directional Search Block Matching Algorithm." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 1 (2017): 230–37. https://doi.org/10.11591/ijece.v7i1.pp230-237.

Full text
Abstract:
This paper proposes compact directional asymmetric search patterns, which we have named as three-point directional search (TDS). In most fast search motion estimation algorithms, a symmetric search pattern is usually set at the minimum block distortion point at each step of the search. The design of the symmetrical pattern in these algorithms relies primarily on the assumption that the direction of convergence is equally alike in each direction with respect to the search center. Therefore, the monotonic property of real -world video sequences is not properly used by these algorithms. The strategy of TDS is to keep searching for the minimum block distortion point in the most probable directions, unlike the previous fast search motion estimation algorithms where all the directions are checked. Therefore, the proposed method significantly reduces the number of search points for locating a motion vector. Compared to conventional fast algorithms, the proposed method has the fastest search speed and most satisfactory PSNR values for all test sequences.
APA, Harvard, Vancouver, ISO, and other styles
3

Matsugu, Shohei, Hiroaki Shiokawa, and Hiroyuki Kitagawa. "Fast Algorithm for Attributed Community Search." Journal of Information Processing 29 (2021): 188–96. http://dx.doi.org/10.2197/ipsjjip.29.188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lin, Y., and S. W. Foo. "Fast search algorithm for tolerance design." IEE Proceedings - Circuits, Devices and Systems 145, no. 1 (1998): 19. http://dx.doi.org/10.1049/ip-cds:19981592.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sunday, Daniel M. "A very fast substring search algorithm." Communications of the ACM 33, no. 8 (1990): 132–42. http://dx.doi.org/10.1145/79173.79184.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Korepin, Vladimir E., and Jinfeng Liao. "Quest for Fast Partial Search Algorithm." Quantum Information Processing 5, no. 3 (2006): 209–26. http://dx.doi.org/10.1007/s11128-006-0024-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, H. S. "Fast search algorithm for vector quantisation." Electronics Letters 28, no. 5 (1992): 457. http://dx.doi.org/10.1049/el:19920288.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Radwan, Ahmed A., Ahmed Swilem, and Mamdouh M. Gomaa. "A Fast Image Encoding Algorithm Based on the Pyramid Structure of Codewords." International Journal of Mobile Computing and Multimedia Communications 1, no. 4 (2009): 1–13. http://dx.doi.org/10.4018/jmcmc.2009072801.

Full text
Abstract:
This article presents a very simple and efficient algorithm for codeword search in the vector quantization encoding. This algorithm uses 2-pixel merging norm pyramid structure to speed up the closest codeword search process. The authors first derive a condition to eliminate unnecessary matching operations from the search procedure. Then, based on this elimination condition, a fast search algorithm is suggested. Simulation results show that, the proposed search algorithm reduces the encoding complexity while maintaining the same encoding quality as that of the full search algorithm. It is also found that the proposed algorithm outperforms the existing search algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Hernández Ulloa, Carlos, William Yeoh, Jorge Baier, Luis Suazo, Han Zhang, and Sven Koenig. "A Simple and Fast Bi-Objective Search Algorithm." Proceedings of the International Symposium on Combinatorial Search 11, no. 1 (2021): 125–26. http://dx.doi.org/10.1609/socs.v11i1.18521.

Full text
Abstract:
Many interesting search problems can be formulated as bi-objective search problems; for example, transportation problems where both travel distance and time need to be minimized. Multi-objective best-first search algorithms need to maintain the set of undominated paths from the start state to each state to compute a set of paths from a given start state to a given goal state (the Pareto-optimal solutions) such that no path in the set is dominated by another path in the set. Each time they find a new path to a state n, they perform a dominance check to determine whether such a path dominates any of the previously found paths to n. Existing algorithms do not perform these checks efficiently, requiring at least a full iteration over the Open list per check. In this paper, we present the first multi-objective algorithm that performs these checks efficiently. Indeed, Bi-Objective A* (BOA*)—our algorithm—requires constant time to check for dominance. Our experimental evaluation shows that BOA*is orders-of-magnitude faster than state-of-the-art search algorithms, such as NAMOA*, Bi-Objective Dijkstra, and Bidirectional Bi-Objective Dijkstra.
APA, Harvard, Vancouver, ISO, and other styles
10

Rajamanickam, Vani, Ushabhanu Nageswaran, and Sangeetha Marikkannan. "Fast Motion Estimation Algorithm using Hybrid Search Patterns for Video Streaming Application." International Journal of Computers Communications & Control 12, no. 5 (2017): 715. http://dx.doi.org/10.15837/ijccc.2017.5.2975.

Full text
Abstract:
The objective of the paper is to develop new block matching Motion Estimation (ME) algorithm using hybrid search patterns along the direction of best match. The search efficiency for sequences with fast motions and high resolutions is improved by proposing New Cross Diagonal-Hexagon Search (NCDHS) algorithm which involves a novel multi half-hexagon grid global search pattern and a cross diagonal-hexagon local search pattern. The new search pattern enables the proposed algorithm to perform better search using 9.068 search points on an average, to obtain optimal motion vector with slight improvement in quality. This inturn reduces ME Time upto 50.11%, 47.12%, 32.99% and 43.28% on average when compared to the existing Diamond Search (DS), Hexagon Search (HS), New Cross Hexagon Search (NHEXS) and Enhanced Diamond Search (EDS) algorithms respectively. The novelty of the algorithm is further achieved by applying the algorithm proposed for live streaming application. The NCDHS algorithm is run on two MATLAB sessions on the same computer by establishing the connection using Transmission Control Protocol (TCP) /Internet Protocol (IP) network. The ME Time obtained is 14.5986 seconds for a block size 16x16, is less when compared to existing algorithms and that makes the NCDHS algorithm suitable for real time streaming application.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Fast search algorithm"

1

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 research presents a detailed investigation of different implementations of two popular nearest neighbour search data structures, KDTrees and Metric Trees, and compares the different implementations of each of the two structures against each other. The best implementations of these structures are then compared against each other and against two other techniques, Annulus Method and Cover Trees. Annulus Method is an old technique that was rediscovered during the research for this thesis. Cover Trees are one of the most novel and promising data structures for nearest neighbour search that have been proposed in the literature.
APA, Harvard, Vancouver, ISO, and other styles
2

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 implemented. The performance of the algorithms are evaluated by using standard 176x 144 pixels quarter common intermediate format (QCIF) benchmark video sequences and the results are compared to the traditional well-known FS Algorithm and a widely used fast search algorithm called the Three Step Search (3SS), The fast search algorithms are known as sub-optimal algorithms as they test only some of the candidate blocks from the search area and choose a match from a subset of blocks. These algorithms can reduce the computational complexity as they do not examine all candidate blocks and hence are algorithmically faster. However, the quality is generally not as good as that of the FS algorithms but can be acceptable in terms of subjective quality. The important metrics, time and Peak Signal to Noise Ratio are used to evaluate the novel algorithms. The results show that the strength of the algorithms lie in their speed of operation as they are much faster than the FS and 3SS. The performance in speed is improved by 85.37% and 22% over the FS and 3SS respectively for the OLS. For the DLS, the speed advantages are 88.77% and 40% over the FS and 3SS. Furthermore, the accuracy of prediction of OLS and DLS are comparahle to the 3SS.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Yu, Ye. "ULTRA-FAST AND MEMORY-EFFICIENT LOOKUPS FOR CLOUD, NETWORKED SYSTEMS, AND MASSIVE DATA MANAGEMENT." UKnowledge, 2018. https://uknowledge.uky.edu/cs_etds/68.

Full text
Abstract:
Systems that process big data (e.g., high-traffic networks and large-scale storage) prefer data structures and algorithms with small memory and fast processing speed. Efficient and fast algorithms play an essential role in system design, despite the improvement of hardware. This dissertation is organized around a novel algorithm called Othello Hashing. Othello Hashing supports ultra-fast and memory-efficient key-value lookup, and it fits the requirements of the core algorithms of many large-scale systems and big data applications. Using Othello hashing, combined with domain expertise in cloud, computer networks, big data, and bioinformatics, I developed the following applications that resolve several major challenges in the area. Concise: Forwarding Information Base. A Forwarding Information Base is a data structure used by the data plane of a forwarding device to determine the proper forwarding actions for packets. The polymorphic property of Othello Hashing the separation of its query and control functionalities, which is a perfect match to the programmable networks such as Software Defined Networks. Using Othello Hashing, we built a fast and scalable FIB named \textit{Concise}. Extensive evaluation results on three different platforms show that Concise outperforms other FIB designs. SDLB: Cloud Load Balancer. In a cloud network, the layer-4 load balancer servers is a device that acts as a reverse proxy and distributes network or application traffic across a number of servers. We built a software load balancer with Othello Hashing techniques named SDLB. SDLB is able to accomplish two functionalities of the SDLB using one Othello query: to find the designated server for packets of ongoing sessions and to distribute new or session-free packets. MetaOthello: Taxonomic Classification of Metagenomic Sequences. Metagenomic read classification is a critical step in the identification and quantification of microbial species sampled by high-throughput sequencing. Due to the growing popularity of metagenomic data in both basic science and clinical applications, as well as the increasing volume of data being generated, efficient and accurate algorithms are in high demand. We built a system to support efficient classification of taxonomic sequences using its k-mer signatures. SeqOthello: RNA-seq Sequence Search Engine. Advances in the study of functional genomics produced a vast supply of RNA-seq datasets. However, how to quickly query and extract information from sequencing resources remains a challenging problem and has been the bottleneck for the broader dissemination of sequencing efforts. The challenge resides in both the sheer volume of the data and its nature of unstructured representation. Using the Othello Hashing techniques, we built the SeqOthello sequence search engine. SeqOthello is a reference-free, alignment-free, and parameter-free sequence search system that supports arbitrary sequence query against large collections of RNA-seq experiments, which enables large-scale integrative studies using sequence-level data.
APA, Harvard, Vancouver, ISO, and other styles
5

Pařenica, Martin. "Implementace algoritmu pro hledání podobností DNA řetězců v FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-236847.

Full text
Abstract:
This paper describes sequence alignment algorithms of nucleotide sequences. There are described pairwise alignment algorithms using database search or dynamic programming. Then in the paper is description of dynamic programming for multiple sequences and algorithm that builds phylogenetic trees. At the end of the first part of the paper is the description of technology FPGA. In the second part that is more practical is described implemntation of the choosen one algorithm. This part includes also examples of some multiple alignments.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

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
8

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 estimation has a big influence to the quality of reconstructed video in the video coding system. Another one important issue about the motion estimation is its high computation complexity that makes it time-consuming in coding scheme. Summarizing those reasons, a fast and accuracy motion estimation algorithm is very important in video coding scheme. Block-matching motion estimation is often used in video coding. Among those block-matching algorithms, full-search algorithm (FS) gets the best performance in the quality of reconstructed video. However, the search points required are too much to make it time-consuming. Hence, there were many fast block-matching algorithms had been developed such as three-step search algorithm (TSS), new three-step search algorithm (NTSS), four-step search algorithm (4SS), block-based gradient descent search algorithm (BBGDS), diamond search algorithm (DS), and hexagon-based search algorithm (HEXBS) etc. These fast search algorithms try to provide an acceptable quality of reconstructed video while reducing number of search points for each block as many as possible. In the thesis, we propose a new algorithm based on cross search pattern, and some additional strategies are used. The strategies, such as prediction, thresholding, and hierarchy etc, help us quickly find the motion vector for each block . Experimental results show that as compared to existing search algorithms the proposed search algorithm requires the less number of search points for each block while maintaining a performance similar to other search algorithms in term of motion compensation errors. approximate quality of reconstructed video while compared to the existing search algorithm.
APA, Harvard, Vancouver, ISO, and other styles
9

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 achieved. In learning analysis, the BSS was built by the learning process, which uses full search VQ (FSVQ) as an inferred function. The BSS-VQ algorithm is applied to the line spectral pairs (LSP) encoder of the G.729 standard, which is a two-stage VQ encoder with a codebook size of 128 and two small codebook sizes of 32. In addition, a moving average (MA) filters the LSP parameter beforehand, and the high correlation characteristics are degraded between consecutive speech frames. These factors present a challenge for developing fast and efficient search algorithms for VQ. In the experiment, the computational savings of DITIE, TSVQ, and BSS-VQ are 61.72%, 88.63%, and 92.36%, respectively, and the quantization accuracy of DITIE, TSVQ, and BSS-VQ are 100%, 26.07%, and 99.22%, respectively, which confirmed the excellent performance of the BSS-VQ algorithm. Moreover, unlike the TIE method, the BSS-VQ algorithm does not depend on the high correlation characteristics of signals to reduce the amount of computation; thus, it is suitable for the LSP encoder of the G.729 standard.
APA, Harvard, Vancouver, ISO, and other styles
10

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
More sources

Book chapters on the topic "Fast search algorithm"

1

Navarro, Gonzalo, and Mathieu Raffinot. "Fast Regular Expression Search." In Algorithm Engineering. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48318-7_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rawal, Pragya, Harish Sharma, and Nirmala Sharma. "Fast Convergent Gravitational Search Algorithm." In Algorithms for Intelligent Systems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-0426-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Navarro, Gonzalo, and Mathieu Raffinot. "Compact DFA Representation for Fast Regular Expression Search." In Algorithm Engineering. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44688-5_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Caramia, Massimiliano, and Paolo Dell’Olmo. "A Fast and Simple Local Search for Graph Coloring." In Algorithm Engineering. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48318-7_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Imamura, Yasunobu, Takeshi Shinohara, Kouichi Hirata, and Tetsuji Kuboyama. "Fast Hilbert Sort Algorithm Without Using Hilbert Indices." In Similarity Search and Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46759-7_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Medini, Soumaya, Philippe Galinier, Massimiliano Di Penta, Yann-Gaël Guéhéneuc, and Giuliano Antoniol. "A Fast Algorithm to Locate Concepts in Execution Traces." In Search Based Software Engineering. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23716-4_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Fuwang, Chun Yuan, and Qingming Liao. "Improved TZsearch Fast Search Algorithm for JMVC." In Proceedings of the 2012 International Conference on Cybernetics and Informatics. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-3872-4_299.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hettipathirana, H. Chathushka Dilhan, and Thameera Viraj Ariyapala. "Geolocation Search with SharePoint Fast Search Feature and A (star) Search Algorithm." In Learning and Collaboration Technologies. Ubiquitous and Virtual Environments for Learning and Collaboration. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-21817-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Birn, Marcel, Manuel Holtgrewe, Peter Sanders, and Johannes Singler. "Simple and Fast Nearest Neighbor Search." In 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611972900.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chakrabarti, Indrajit, Kota Naga Srinivasarao Batta, and Sumit Kumar Chatterjee. "VLSI Architecture for Fast Three Step Search Algorithm." In Motion Estimation for Video Coding. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14376-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fast search algorithm"

1

Qi, Meibin, Debao Wang, Jianguo Jiang, and Baolei An. "A Search Direction Extensible Fast Search Algorithm." In 2006 First International Symposium on Pervasive Computing and Applications. IEEE, 2006. http://dx.doi.org/10.1109/spca.2006.297469.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Darwish, Ahmed M. "Fast nearest-neighbor search algorithm." In Electronic Imaging: Science & Technology, edited by Robert L. Stevenson, Alexander I. Drukarev, and Thomas R. Gardos. SPIE, 1996. http://dx.doi.org/10.1117/12.234757.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shamsudin, Hasrul Che, Addie Irawan, Zuwairie Ibrahim, et al. "A Fast Discrete Gravitational Search Algorithm." In 2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation (CIMSiM). IEEE, 2012. http://dx.doi.org/10.1109/cimsim.2012.28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kulkarni, Arun B., and Gopal M. Pardesi. "Fast search algorithm for vector quantization." In the International Conference. ACM Press, 2009. http://dx.doi.org/10.1145/1523103.1523164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jalalpour, Majid, and Ali Aghagolzadeh. "Fast search algorithm for video coding." In 2015 9th Iranian Conference on Machine Vision and Image Processing (MVIP). IEEE, 2015. http://dx.doi.org/10.1109/iranianmvip.2015.7397524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Orchard, M. T. "A fast nearest-neighbor search algorithm." In [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1991. http://dx.doi.org/10.1109/icassp.1991.150755.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tsai, Chun-Wei, Ko-Wei Huango, Ming-Chao Chiang, and Chu-Sing Yang. "A fast tree-based search algorithm for cluster search engine." In 2009 IEEE International Conference on Systems, Man and Cybernetics - SMC. IEEE, 2009. http://dx.doi.org/10.1109/icsmc.2009.5346100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gog, Simon, Alistair Moffat, and Matthias Petri. "CSA++: Fast Pattern Search for Large Alphabets." In 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974768.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Xie, Lifen, Chunqing Huang, and Bihui Chen. "UMHexagonS search algorithm for fast motion estimation." In 2011 3rd International Conference on Computer Research and Development (ICCRD). IEEE, 2011. http://dx.doi.org/10.1109/iccrd.2011.5764063.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chong, Wen Mau, Chien Le Goh, Yoon Teck Bau, and Kian Chin Lee. "Fast Numerical Threshold Search Algorithm for C4.5." In 2014 IIAI 3rd International Conference on Advanced Applied Informatics (IIAIAAI). IEEE, 2014. http://dx.doi.org/10.1109/iiai-aai.2014.183.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Fast search algorithm"

1

ALDRIDGE, DAVID F. Fast Grid Search Algorithm for Seismic Source Location. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/759476.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Horrocks, Ian, and Ulrike Sattler. Optimised Reasoning for SHIQ. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.118.

Full text
Abstract:
The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability and subsumption in SHIQ, a very expressive description logic providing, e.g., inverse and transitive roles, number restrictions, and general axioms. Intuitively, the algorithm searches for a tree-shaped abstraction of a model. To ensure termination of this algorithm without comprimising correctness, it stops expanding paths in the search tree using a so-called 'double-blocking' condition.
APA, Harvard, Vancouver, ISO, and other styles
3

Digalakis, V., M. Ostendorf, and J. R. Rohlicek. Fast Search Algorithms for Connected Phone Recognition Using the Stochastic Segment Model. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada459580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tan, Peng, and Nicholas Sitar. Parallel Level-Set DEM (LS-DEM) Development and Application to the Study of Deformation and Flow of Granular Media. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, 2023. http://dx.doi.org/10.55461/kmiz5819.

Full text
Abstract:
We present a systematic investigation of computational approaches to the modeling of granular materials. Granular materials are ubiquitous in everyday life and in a variety of engineering and industrial applications. Despite the apparent simplicity of the laws governing particle-scale interactions, predicting the continuum mechanical response of granular materials still poses extraordinary challenges. This is largely due to the complex history dependence resulting from continuous rearrangement of the microstructure of granular material, as well as the mechanical interlocking due to grain morphology and surface roughness. X-Ray Computed Tomography (XRCT) is used to characterize the grain morphology and the fabric of the granular media, naturally deposited sand in this study. The Level-Set based Discrete Element Method (LS-DEM) is then used to bridge the granular behavior gap between the micro and macro scale. The LS-DEM establishes a one-to-one correspondence between granular objects and numerical avatars and captures the details of grain morphology and surface roughness. However, the high-fidelity representation significantly increases the demands on computational resources. To this end a parallel version of LS-DEM is introduced to significantly decrease the computational demands. The code employs a binning algorithm, which reduces the search complexity of contact detection from O(n2) to O(n), and a domain decomposition strategy is used to elicit parallel computing in a memory- and communication-efficient manner. The parallel implementation shows good scalability and efficiency. High fidelity LS avatars obtained from XRCT images of naturally deposited sand are then used to replicate the results of triaxial tests using the new, parallel LS-DEM code. The result show that both micro- and macro-mechanical behavior of natural material is well captured and is consistent with experimental data, confirming experimental observation that the primary source of peak strength of sand is the mechanical interlocking between irregularly shaped grains. Specifically, triaxial test simulations with a flexible membrane produce a very good match to experimentally observed relationships between deviatoric stress and mobilized friction angle for naturally deposited sand. We then explore the viability of modeling dynamic problems with a new formulation of an impulse based LS-DEM. The new formulation is stable, fast, and energy conservative. However, it can be numerically stiff when the assembly has substantial mass differences between particles. We also demonstrate the feasibility of modeling deformable structures in the rigid body framework and propose several enhancements to improve the convergence of collision resolution, including a hybrid time integration scheme to separately handle at rest contacts and dynamic collisions. Finally, we extend the impulse-based LS-DEM to include arbitrarily shaped topographic surfaces and exploit its algorithmic advantages to demonstrate the feasibility of modeling realistic behavior of granular flows. The novel formulation significantly improves performance of dynamic simulations by allowing larger time steps, which is advantageous for observing the full development of physical phenomena such as rock avalanches, which we present as an illustrative example.
APA, Harvard, Vancouver, ISO, and other styles
5

Galili, Naftali, Roger P. Rohrbach, Itzhak Shmulevich, Yoram Fuchs, and Giora Zauberman. Non-Destructive Quality Sensing of High-Value Agricultural Commodities Through Response Analysis. United States Department of Agriculture, 1994. http://dx.doi.org/10.32747/1994.7570549.bard.

Full text
Abstract:
The objectives of this project were to develop nondestructive methods for detection of internal properties and firmness of fruits and vegetables. One method was based on a soft piezoelectric film transducer developed in the Technion, for analysis of fruit response to low-energy excitation. The second method was a dot-matrix piezoelectric transducer of North Carolina State University, developed for contact-pressure analysis of fruit during impact. Two research teams, one in Israel and the other in North Carolina, coordinated their research effort according to the specific objectives of the project, to develop and apply the two complementary methods for quality control of agricultural commodities. In Israel: An improved firmness testing system was developed and tested with tropical fruits. The new system included an instrumented fruit-bed of three flexible piezoelectric sensors and miniature electromagnetic hammers, which served as fruit support and low-energy excitation device, respectively. Resonant frequencies were detected for determination of firmness index. Two new acoustic parameters were developed for evaluation of fruit firmness and maturity: a dumping-ratio and a centeroid of the frequency response. Experiments were performed with avocado and mango fruits. The internal damping ratio, which may indicate fruit ripeness, increased monotonically with time, while resonant frequencies and firmness indices decreased with time. Fruit samples were tested daily by destructive penetration test. A fairy high correlation was found in tropical fruits between the penetration force and the new acoustic parameters; a lower correlation was found between this parameter and the conventional firmness index. Improved table-top firmness testing units, Firmalon, with data-logging system and on-line data analysis capacity have been built. The new device was used for the full-scale experiments in the next two years, ahead of the original program and BARD timetable. Close cooperation was initiated with local industry for development of both off-line and on-line sorting and quality control of more agricultural commodities. Firmalon units were produced and operated in major packaging houses in Israel, Belgium and Washington State, on mango and avocado, apples, pears, tomatoes, melons and some other fruits, to gain field experience with the new method. The accumulated experimental data from all these activities is still analyzed, to improve firmness sorting criteria and shelf-life predicting curves for the different fruits. The test program in commercial CA storage facilities in Washington State included seven apple varieties: Fuji, Braeburn, Gala, Granny Smith, Jonagold, Red Delicious, Golden Delicious, and D'Anjou pear variety. FI master-curves could be developed for the Braeburn, Gala, Granny Smith and Jonagold apples. These fruits showed a steady ripening process during the test period. Yet, more work should be conducted to reduce scattering of the data and to determine the confidence limits of the method. Nearly constant FI in Red Delicious and the fluctuations of FI in the Fuji apples should be re-examined. Three sets of experiment were performed with Flandria tomatoes. Despite the complex structure of the tomatoes, the acoustic method could be used for firmness evaluation and to follow the ripening evolution with time. Close agreement was achieved between the auction expert evaluation and that of the nondestructive acoustic test, where firmness index of 4.0 and more indicated grade-A tomatoes. More work is performed to refine the sorting algorithm and to develop a general ripening scale for automatic grading of tomatoes for the fresh fruit market. Galia melons were tested in Israel, in simulated export conditions. It was concluded that the Firmalon is capable of detecting the ripening of melons nondestructively, and sorted out the defective fruits from the export shipment. The cooperation with local industry resulted in development of automatic on-line prototype of the acoustic sensor, that may be incorporated with the export quality control system for melons. More interesting is the development of the remote firmness sensing method for sealed CA cool-rooms, where most of the full-year fruit yield in stored for off-season consumption. Hundreds of ripening monitor systems have been installed in major fruit storage facilities, and being evaluated now by the consumers. If successful, the new method may cause a major change in long-term fruit storage technology. More uses of the acoustic test method have been considered, for monitoring fruit maturity and harvest time, testing fruit samples or each individual fruit when entering the storage facilities, packaging house and auction, and in the supermarket. This approach may result in a full line of equipment for nondestructive quality control of fruits and vegetables, from the orchard or the greenhouse, through the entire sorting, grading and storage process, up to the consumer table. The developed technology offers a tool to determine the maturity of the fruits nondestructively by monitoring their acoustic response to mechanical impulse on the tree. A special device was built and preliminary tested in mango fruit. More development is needed to develop a portable, hand operated sensing method for this purpose. In North Carolina: Analysis method based on an Auto-Regressive (AR) model was developed for detecting the first resonance of fruit from their response to mechanical impulse. The algorithm included a routine that detects the first resonant frequency from as many sensors as possible. Experiments on Red Delicious apples were performed and their firmness was determined. The AR method allowed the detection of the first resonance. The method could be fast enough to be utilized in a real time sorting machine. Yet, further study is needed to look for improvement of the search algorithm of the methods. An impact contact-pressure measurement system and Neural Network (NN) identification method were developed to investigate the relationships between surface pressure distributions on selected fruits and their respective internal textural qualities. A piezoelectric dot-matrix pressure transducer was developed for the purpose of acquiring time-sampled pressure profiles during impact. The acquired data was transferred into a personal computer and accurate visualization of animated data were presented. Preliminary test with 10 apples has been performed. Measurement were made by the contact-pressure transducer in two different positions. Complementary measurements were made on the same apples by using the Firmalon and Magness Taylor (MT) testers. Three-layer neural network was designed. 2/3 of the contact-pressure data were used as training input data and corresponding MT data as training target data. The remaining data were used as NN checking data. Six samples randomly chosen from the ten measured samples and their corresponding Firmalon values were used as the NN training and target data, respectively. The remaining four samples' data were input to the NN. The NN results consistent with the Firmness Tester values. So, if more training data would be obtained, the output should be more accurate. In addition, the Firmness Tester values do not consistent with MT firmness tester values. The NN method developed in this study appears to be a useful tool to emulate the MT Firmness test results without destroying the apple samples. To get more accurate estimation of MT firmness a much larger training data set is required. When the larger sensitive area of the pressure sensor being developed in this project becomes available, the entire contact 'shape' will provide additional information and the neural network results would be more accurate. It has been shown that the impact information can be utilized in the determination of internal quality factors of fruit. Until now,
APA, Harvard, Vancouver, ISO, and other styles
6

Synchak, Bohdan. Freedom of choice and freedom of action in the Ukrainian media. Ivan Franko National University of Lviv, 2022. http://dx.doi.org/10.30970/vjo.2022.51.11400.

Full text
Abstract:
The article talks about the philosophical foundations that characterize the mechanism of internal inducement to action. As an academic, constitutional, and socio-ideological concept, the boundaries of freedom are outlined, which are displayed in the field of modern media space. The term «freedom» is considered as several philosophical concepts that formed the basis of the modern interpretation of this concept. The totality of its meanings is generalized into one that is adapted for the modern system. Parallels are drawn between the interaction of the concept of user freedom with the plane of domestic mass media because despite, the fact that consciousness is knowledge, the incoming information directly affects the individual and collective consciousness. Using the example of the most popular digital platforms, the components of the impact on users and the legal aspect of their implementation are analyzed. When considering the issues of freedom of choice and freedom of action on the Internet, special attention is paid to methods of collecting and processing information, in particular, the limitations and possibilities of digital programs-algorithms of the popular search engine Google. The types of personal information collected by Google about the user are classified and the possible mechanisms of influence on personal choice and access to information on the Internet are characterized. The article analyzes the constitutional guarantees of freedom and the impact of digital technologies on them. Particular attention is paid to ethics, in particular journalistic, which nominally regulates the limits of the humane, permissible, a / moral (unacceptable/acceptable) in the implementation of professional information activities in the media. Thus, the issue of freedom of choice and freedom of action in the plane of domestic mass media is subject to an objective examination of its components, they are analyzed for a proper constitutionally suitable phenomenon, which must be investigated from the point of view of compliance with human rights and freedoms and professional standards within the media.
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!