Academic literature on the topic 'Nearest Neighbour'

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 'Nearest Neighbour.'

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 "Nearest Neighbour"

1

Mahfouz, Mohamed A. "INCORPORATING DENSITY IN K-NEAREST NEIGHBORS REGRESSION." International Journal of Advanced Research in Computer Science 14, no. 03 (2023): 144–49. http://dx.doi.org/10.26483/ijarcs.v14i3.6989.

Full text
Abstract:
The application of the traditional k-nearest neighbours in regression analysis suffers from several difficulties when only a limited number of samples are available. In this paper, two decision models based on density are proposed. In order to reduce testing time, a k-nearest neighbours table (kNN-Table) is maintained to keep the neighbours of each object x along with their weighted Manhattan distance to x and a binary vector representing the increase or the decrease in each dimension compared to x’s values. In the first decision model, if the unseen sample having a distance to one of its neig
APA, Harvard, Vancouver, ISO, and other styles
2

Cunningham, Pádraig, and Sarah Jane Delany. "k-Nearest Neighbour Classifiers - A Tutorial." ACM Computing Surveys 54, no. 6 (2021): 1–25. http://dx.doi.org/10.1145/3459665.

Full text
Abstract:
Perhaps the most straightforward classifier in the arsenal or Machine Learning techniques is the Nearest Neighbour Classifier—classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance, because issues of poor runtime performance is not such a problem these days with the computational power that is available. This article presents an overview of techniques for Nearest Neighbour classification focusing on: mechanisms for assessing similarity (distan
APA, Harvard, Vancouver, ISO, and other styles
3

Stanley, Peter M. "Our Nearest Neighbour." Expository Times 96, no. 7 (1985): 209–10. http://dx.doi.org/10.1177/001452468509600706.

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

Hasler, Caren, and Yves Tillé. "Balancedk-nearest neighbour imputation." Statistics 50, no. 6 (2016): 1310–31. http://dx.doi.org/10.1080/02331888.2016.1230615.

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

Plataniotis, K. N., D. Androutsos, V. Sri, and A. N. Venetsanopoulos. "Nearest-neighbour multichannel filter." Electronics Letters 31, no. 22 (1995): 1910–11. http://dx.doi.org/10.1049/el:19951294.

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

Chaplain, Gregory J., Dan Moore, Ian Hooper, Alastair Hibbins, John Sambles, and Timothy Starkey. "Beyond-nearest-neighbour metamaterials." Journal of the Acoustical Society of America 154, no. 4_supplement (2023): A156. http://dx.doi.org/10.1121/10.0023108.

Full text
Abstract:
Engineering the dispersion of acoustic or elastic waves using coupling terms that spatially reach beyond the immediate local environment, or unit cell, is an “emerging topic” in Metamaterial design. In this talk, we present experimental studies in acoustic and elastic systems that realize beyond-nearest-neighbour coupling to introduce dispersion relations with extrema within the first Brilloun Zone. In acoustics, we use mixed waveguide-surfacewave coupling, while in elasticity we develop an elastic scaffold (made from meccano) with reconfigurable coupling elements and demonstrate the effects o
APA, Harvard, Vancouver, ISO, and other styles
7

Lu, Zhigang, and Hong Shen. "An accuracy-assured privacy-preserving recommender system for internet commerce." Computer Science and Information Systems 12, no. 4 (2015): 1307–26. http://dx.doi.org/10.2298/csis140725056l.

Full text
Abstract:
Recommender systems, tool for predicting users? potential preferences by computing history data and users? interests, show an increasing importance in various Internet applications such as online shopping. As a well-known recommendation method, neighbourhood-based collaborative filtering has attracted considerable attentions recently. The risk of revealing users? private information during the process of filtering has attracted noticeable research interests. Among the current solutions, the probabilistic techniques have shown a powerful privacy preserving effect. The existing methods deploying
APA, Harvard, Vancouver, ISO, and other styles
8

Ati, Indri, and Ari Kusyanti. "Metode Ensemble Classifier untuk Mendeteksi Jenis Attention Deficit Hyperactivity Disorder (SDHD) pada Anak Usia Dini." Jurnal Teknologi Informasi dan Ilmu Komputer 6, no. 3 (2019): 301. http://dx.doi.org/10.25126/jtiik.2019631313.

Full text
Abstract:
<p class="Abstract">Pada awal masa perkembangan, beberapa anak mengalami hambatan diantaranya sulit untuk diam, sulit untuk berkonsentrasi dan mengontrol perilakunya, apabila anak mengalami gangguan pemusatan perhatian dan sulit mengontrol perilaku yang sesuai, dapat disebut dengan ADHD (Attention Deficit Hyperactive Disorder). Ini merupakan masalah yang serius dikarenakan anak penyandang ADHD mengalami masalah perilaku sosial, emosional dan mengalami kesulitan belajar sekolah sehingga akan mempengaruhi perkembangan pada masa dewasa anak penyandang ADHD. Oleh karena itu perlu diketahui g
APA, Harvard, Vancouver, ISO, and other styles
9

Myasnikov, E. "Exact Nearest Neighbour Search within Constrained Neighbourhood Using the Forest of Vp-Tree-Like Structures." Journal of Physics: Conference Series 2096, no. 1 (2021): 012199. http://dx.doi.org/10.1088/1742-6596/2096/1/012199.

Full text
Abstract:
Abstract In this paper, we address the problem of fast nearest neighbour search. Unfortunately, well-known indexing data structures, such as vp-trees perform poorly on some datasets and do not provide significant acceleration compared to the brute force approach. In the paper, we consider an alternative solution, which can be applied if we are not interested in some fraction of distant nearest neighbours. This solution is based on building the forest of vp-tree-like structures and guarantees the exact nearest neighbour search in the epsilon-neighbourhood of the query point.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Zizhu, and Miguel Navascués. "Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 474, no. 2217 (2018): 20170822. http://dx.doi.org/10.1098/rspa.2017.0822.

Full text
Abstract:
We study the properties of the set of marginal distributions of infinite translation-invariant systems in the two-dimensional square lattice. In cases where the local variables can only take a small number d of possible values, we completely solve the marginal or membership problem for nearest-neighbours distributions ( d = 2, 3) and nearest and next-to-nearest neighbours distributions ( d = 2). Remarkably, all these sets form convex polytopes in probability space. This allows us to devise an algorithm to compute the minimum energy per site of any TI Hamiltonian in these scenarios exactly. We
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Nearest Neighbour"

1

Lloyd, Michael. "Nearest neighbour epidemic processes." Thesis, Heriot-Watt University, 1994. http://hdl.handle.net/10399/747.

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

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
3

Bermejo, Sánchez Sergio. "Learning with nearest neighbour classifiers." Doctoral thesis, Universitat Politècnica de Catalunya, 2000. http://hdl.handle.net/10803/6323.

Full text
Abstract:
Premi extraordinari ex-aequo en l'àmbit d'Electrònica i Telecomunicacions. Convocatoria 1999 - 2000<br>Nearest Neighbour (NN) classifiers are one of the most celebrated algorithms in machine learning. In recent years, interest in these methods has flourished again in several fields (including statistics, machine learning and pattern recognition) since, in spite of their simplicity, they reveal as powerful non-parametric classification systems in real-world problems. The present work is mainly devoted to the development of new learning algorithms for these classifiers and is focused on the foll
APA, Harvard, Vancouver, ISO, and other styles
4

Asyhari, Agustian Taufiq. "Nearest neighbour decoding for fading channels." Thesis, University of Cambridge, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610448.

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

Mittinty, Murthy N. "Nearest neighbour imputation and variance estimation methods." Thesis, University of Canterbury. Mathematics and Statistics, 2004. http://hdl.handle.net/10092/5643.

Full text
Abstract:
In large-scale surveys, non-response is a common phenomenon. This non-response can be of two types; unit and item non-response. In this thesis we deal with item non-response as other responses from the survey unit can be used for adjustment. Usually non-response adjustment is carried out in one of three ways; weighting, imputation and no adjustments. Imputation is the most commonly used adjustment method, either as single imputation or multiple imputations. In this thesis we study single imputation, in particular nearest neighbour methods, and we have developed a new method. Our method is base
APA, Harvard, Vancouver, ISO, and other styles
6

Shehu, Usman Gulumbe. "Cube technique for Nearest Neighbour(s) search." Thesis, University of Strathclyde, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248365.

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

Muja, Marius. "Scalable nearest neighbour methods for high dimensional data." Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/44402.

Full text
Abstract:
For many computer vision and machine learning problems, large training sets are key for good performance. However, the most computationally expensive part of many computer vision and machine learning algorithms consists of finding nearest neighbour matches to high dimensional vectors that represent the training data. We propose new algorithms for approximate nearest neighbour matching and evaluate and compare them with previous algorithms. For matching high dimensional features, we find two algorithms to be the most efficient: the randomized k-d forest and a new algorithm proposed in thi
APA, Harvard, Vancouver, ISO, and other styles
8

Payne, Terry R. "Dimensionality reduction and representation for nearest neighbour learning." Thesis, University of Aberdeen, 1999. https://eprints.soton.ac.uk/257788/.

Full text
Abstract:
An increasing number of intelligent information agents employ Nearest Neighbour learning algorithms to provide personalised assistance to the user. This assistance may be in the form of recognising or locating documents that the user might find relevant or interesting. To achieve this, documents must be mapped into a representation that can be presented to the learning algorithm. Simple heuristic techniques are generally used to identify relevant terms from the documents. These terms are then used to construct large, sparse training vectors. The work presented here investigates an alternative
APA, Harvard, Vancouver, ISO, and other styles
9

Casselryd, Oskar, and Filip Jansson. "Troll detection with sentiment analysis and nearest neighbour search." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209474.

Full text
Abstract:
Internet trolls are gaining more influence in society due to the rapidgrowth of social media. A troll farm is a group of Internet trolls that get paid to spread certain opinions or information online. Identifying a troll farm can be difficult, since the trolls try to stay hidden. This study examines if it is possible to identify troll farms on Twitter by conducting a sentiment analysis on user tweets and modeling it as a nearest neighbor problem. The experiment was done with 4 simulated trolls and 150 normal twitter users. The users were modelled into datapoints based on the sentiment, frequen
APA, Harvard, Vancouver, ISO, and other styles
10

Chandgotia, Nishant. "Markov random fields and measures with nearest neighbour Gibbs potential." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/37000.

Full text
Abstract:
This thesis will discuss the relationship between stationary Markov random fields and probability measures with a nearest neighbour Gibbs potential. While the relationship has been well explored when the measures are fully supported, we shall discuss what happens when we weaken this assumption.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Nearest Neighbour"

1

Başan, Ghillie. The moon's our nearest neighbour. Warner Books, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Roopchansingh, Ajay. Nearest neighbour interconnect architecture in deep-submicron FPGAs. National Library of Canada, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guo, Gongde. A study on the nearest neighbour method and its applications. The Author], 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gwennyth, Zainu'ddin Ailsa, Australian Indonesian Association Victoria, and Monash University. Centre of Southeast Asian Studies., eds. Nearest southern neighbour: Some Indonesian views of Australia and Australians. Monash University, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brandsma, Theo. Rainfall generator for the Rhine Basin: Single-site generation of weather variables by nearest-neighbour resampling. KNMI, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Biau, Gérard, and Luc Devroye. Lectures on the Nearest Neighbor Method. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25388-6.

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

V, Dasarathy Belur, ed. Nearest neighbor (NN) norms: Nn pattern classification techniques. IEEE Computer Society Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kramer, Oliver. Dimensionality Reduction with Unsupervised Nearest Neighbors. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38652-7.

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

Kramer, Oliver. Dimensionality Reduction with Unsupervised Nearest Neighbors. Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Andersen, Torben G. Jump-robust volatility estimation using nearest neighbor truncation. National Bureau of Economic Research, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Nearest Neighbour"

1

Murty, M. Narasimha, and V. Susheela Devi. "Nearest Neighbour Based Classifiers." In Undergraduate Topics in Computer Science. Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-495-1_3.

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

Nowicki, Robert K. "Rough Nearest Neighbour Classifier." In Studies in Computational Intelligence. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03895-3_6.

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

Borchers, D. L., S. T. Buckland, and W. Zucchini. "Nearest neighbour and point-to-nearest-object." In Statistics for Biology and Health. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3708-5_8.

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

Jensen, Richard, and Chris Cornelis. "Fuzzy-Rough Nearest Neighbour Classification." In Transactions on Rough Sets XIII. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18302-7_4.

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

Sainin, Mohd Shamrie, and Rayner Alfred. "Nearest Neighbour Distance Matrix Classification." In Advanced Data Mining and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17316-5_11.

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

Henery, R. J., and U. G. Shehu. "A Fast Nearest Neighbour Algorithm." In Progress in Industrial Mathematics at ECMI 2000. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-04784-2_78.

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

Moreno-Seco, Francisco, Luisa Micó, and Jose Oncina. "Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-70659-3_75.

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

Sharma, Lokesh K., Om Prakash Vyas, Simon Schieder, and Ajaya K. Akasapu. "Nearest Neighbour Classification for Trajectory Data." In Information and Communication Technologies. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15766-0_26.

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

Tripathi, Tanya, B. Deevena Raju, and M. Suresh Babu. "K Nearest Neighbour: A Dynamic Model." In Disruptive technologies in Computing and Communication Systems. CRC Press, 2024. http://dx.doi.org/10.1201/9781032665535-43.

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

Trudgian, Dave C. "Spam Classification Using Nearest Neighbour Techniques." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28651-6_85.

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

Conference papers on the topic "Nearest Neighbour"

1

Hall, Peter. "Properties of Nearest-neighbour Classifiers." In Proceedings of the International Statistics Workshop. WORLD SCIENTIFIC, 2006. http://dx.doi.org/10.1142/9789812772466_0024.

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

Harwood, Ben, and Tom Drummond. "FANNG: Fast Approximate Nearest Neighbour Graphs." In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2016. http://dx.doi.org/10.1109/cvpr.2016.616.

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

Bojilov, Ljudmil. "Nearest Neighbour Criterion - Analitical Performance Evaluation." In IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06). IEEE, 2006. http://dx.doi.org/10.1109/jva.2006.35.

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

Abdullah, S. M., Peter Tischer, Sudanthi Wijewickrema, and Andrew Paplinski. "Hierarchical Mutual Nearest Neighbour Image Segmentation." In 2016 International Conference on Digital Image Computing: Techniques and Applications (DICTA). IEEE, 2016. http://dx.doi.org/10.1109/dicta.2016.7797047.

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

Vinay Kumar, B. R. "Spatial Queues with Nearest Neighbour Shifts." In 2023 35th International Teletraffic Congress (ITC-35). IEEE, 2023. http://dx.doi.org/10.1109/itc-3560063.2023.10555680.

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

Ferro, Demetrio, Vincent Gripon, and Xiaoran Jiang. "Nearest Neighbour Search using binary neural networks." In 2016 International Joint Conference on Neural Networks (IJCNN). IEEE, 2016. http://dx.doi.org/10.1109/ijcnn.2016.7727873.

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

Schwehm, Gerhard H. "Venus Express - Exploring Earth's Nearest Planetary Neighbour." In 57th International Astronautical Congress. American Institute of Aeronautics and Astronautics, 2006. http://dx.doi.org/10.2514/6.iac-06-h.l.2.01.

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

Terzić, Kasim, Hussein Adnan Mohammed, and J. M. H. du Buf. "Shape Detection with Nearest Neighbour Contour Fragments." In British Machine Vision Conference 2015. British Machine Vision Association, 2015. http://dx.doi.org/10.5244/c.29.59.

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

Qu, Yanpeng, Changjing Shang, Qiang Shen, Neil Mac Parthalain, and Wei Wu. "Kernel-based fuzzy-rough nearest neighbour classification." In 2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2011. http://dx.doi.org/10.1109/fuzzy.2011.6007401.

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

Cafagna, Francesco, Michael H. Böhlen, and Annelies Bracher. "Nearest Neighbour Join with Groups and Predicates." In CIKM'15: 24th ACM International Conference on Information and Knowledge Management. ACM, 2015. http://dx.doi.org/10.1145/2811222.2811225.

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

Reports on the topic "Nearest Neighbour"

1

Carroll, R. J., and W. Hardle. Symmetrized Nearest Neighbor Regression Estimates. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada191998.

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

Weingart, M., and S. Selvin. Nearest neighbor analysis in one dimension. Office of Scientific and Technical Information (OSTI), 1995. http://dx.doi.org/10.2172/33152.

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

Mackey, Greg Edward. Efficient nearest neighbor searches in N-ABLE. Office of Scientific and Technical Information (OSTI), 2010. http://dx.doi.org/10.2172/992313.

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

Jones, Peter W., Andrei Osipov, and Vladimir Rokhlin. A Randomized Approximate Nearest Neighbors Algorithm. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada555156.

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

Andersen, Torben, Dobrislav Dobrev, and Ernst Schaumburg. Jump-Robust Volatility Estimation using Nearest Neighbor Truncation. National Bureau of Economic Research, 2009. http://dx.doi.org/10.3386/w15533.

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

Han, Euihong, George Karypis, and Vipin Kumar. Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada439688.

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

Gonzales, Antonio, and Nicholas Paul Blazier. Enhanced Approximate Nearest Neighbor via Local Area Focused Search. Office of Scientific and Technical Information (OSTI), 2017. http://dx.doi.org/10.2172/1367491.

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

Anandkumar, Animashree, Lang Tong, and Ananthram Swami. Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada536158.

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

Bayer, Patrick, Marcus Casey, W. Ben McCartney, John Orellana-Li, and Calvin Zhang. Distinguishing Causes of Neighborhood Racial Change: A Nearest Neighbor Design. National Bureau of Economic Research, 2022. http://dx.doi.org/10.3386/w30487.

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

Jones, Peter W., Andrei Osipov, and Vladimir Rokhlin. A Randomized Approximate Nearest Neighbors Algorithm - A Short Version. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada639824.

Full text
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!