Academic literature on the topic 'Distance vectors'

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 'Distance vectors.'

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 "Distance vectors"

1

Guo, Li, Guo Feng Liu, and Yu E. Bao. "A Study of FCM Clustering Algorithm Based on Interval Multiple Attribute Information." Applied Mechanics and Materials 444-445 (October 2013): 676–80. http://dx.doi.org/10.4028/www.scientific.net/amm.444-445.676.

Full text
Abstract:
In multiple attribute clustering algorithms with uncertain interval numbers, most of the distances between the interval-valued vectors only consider the differences of each interval endpoint ignoring a lot of information. To solve this problem, according to the differences between corresponding points in each interval number, this paper gives a distance formula between interval-valued vectors, extends a FCM clustering algorithm based on interval multiple attribute information. Through an example, we prove the validity and rationality of the algorithm. Keywords: interval-valued vector; FCM clustering algorithm; distance measure; fuzzy partition
APA, Harvard, Vancouver, ISO, and other styles
2

Wu, Shen Hui, Sridhar Jandhyala, Yashwant K. Malaiya, and Anura P. Jayasumana. "Antirandom Testing: A Distance-Based Approach." VLSI Design 2008 (March 17, 2008): 1–9. http://dx.doi.org/10.1155/2008/165709.

Full text
Abstract:
Random testing requires each test to be selected randomly regardless of the tests previously applied. This paper introduces the concept of antirandom testing where each test applied is chosen such that its total distance from all previous tests is maximum. This spans the test vector space to the maximum extent possible for a given number of vectors. An algorithm for generating antirandom tests is presented. Compared with traditional pseudorandom testing, antirandom testing is found to be very effective when a high-fault coverage needs to be achieved with a limited number of test vectors. The superiority of the new approach is even more significant for testing bridging faults.
APA, Harvard, Vancouver, ISO, and other styles
3

Yi, Jing, Xue Dong Li, Xiao Feng Li, and Hong Ling Gou. "Research on P2P Transmission Optimizing Strategy." Applied Mechanics and Materials 513-517 (February 2014): 1797–802. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1797.

Full text
Abstract:
To reduce the congestion of trunk network caused by P2P transmission, a P2P transmission optimizing scheme is introduced in metropolitan area network (MAN) in this paper. In this scheme distance vectors such as Huffman Code are used to represent topology relations of nodes in MAN, and distance vectors of nodes which store nodes in topology server are built. According to the distance vectors, physical distances of each node are calculated, and most transmission flow is controlled on the edge of MAN, thus transmission optimizing is realized.
APA, Harvard, Vancouver, ISO, and other styles
4

Lei, Lei, and She Kun. "Speaker Recognition Using Wavelet Packet Entropy, I-Vector, and Cosine Distance Scoring." Journal of Electrical and Computer Engineering 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/1735698.

Full text
Abstract:
Today, more and more people have benefited from the speaker recognition. However, the accuracy of speaker recognition often drops off rapidly because of the low-quality speech and noise. This paper proposed a new speaker recognition model based on wavelet packet entropy (WPE), i-vector, and cosine distance scoring (CDS). In the proposed model, WPE transforms the speeches into short-term spectrum feature vectors (short vectors) and resists the noise. I-vector is generated from those short vectors and characterizes speech to improve the recognition accuracy. CDS fast compares with the difference between two i-vectors to give out the recognition result. The proposed model is evaluated by TIMIT speech database. The results of the experiments show that the proposed model can obtain good performance in clear and noisy environment and be insensitive to the low-quality speech, but the time cost of the model is high. To reduce the time cost, the parallel computation is used.
APA, Harvard, Vancouver, ISO, and other styles
5

Drakakis, Konstantinos, Roderick Gow, and Scott Rickard. "Common distance vectors between Costas arrays." Advances in Mathematics of Communications 3, no. 1 (2009): 35–52. http://dx.doi.org/10.3934/amc.2009.3.35.

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

OZTURK, OZGUR, and HAKAN FERHATOSMANOGLU. "VECTOR SPACE INDEXING FOR BIOSEQUENCE SIMILARITY SEARCHES." International Journal on Artificial Intelligence Tools 14, no. 05 (October 2005): 811–26. http://dx.doi.org/10.1142/s0218213005002405.

Full text
Abstract:
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequences into numerical vector domains and build efficient index structures on the transformed vectors. We then define distance functions in the transformed domain and examine properties of these functions. We experimentally compared their (a) approximation quality for k-Nearest Neighbor (k-NN) queries and both (b) pruning ability and (c) approximation quality for ε-range queries. Results for k-NN queries, which we present here, show that our proposed distances FD2 and WD2 (i.e. Frequency and Wavelet Distance functions for 2-grams) perform significantly better than the others. We then develop effective index structures, based on R-trees and scalar quantization, on top of transformed vectors and distance functions. Promising results from the experiments on real biosequence data sets are presented.
APA, Harvard, Vancouver, ISO, and other styles
7

Qian, Yan, Chun Guang Bai, Bai Quan Chen, and Gui Jin Mu. "Research on the Factors of Wind Direction and Distance in the Impact of Sand Source on its Neighborhood: An Example from Three Regions of Southern Xinjiang, China." Applied Mechanics and Materials 507 (January 2014): 845–50. http://dx.doi.org/10.4028/www.scientific.net/amm.507.845.

Full text
Abstract:
Wind-blown sand is now one of the most serious environmental issues around the world. The properties of wind and the distance from sand source to the affected locations are two most important factors for assessing the effect of the sand source on its neighborhood. To acquire better assessment result, the methods of wind vector interpolation and the measurement of the distance from sand source to the affected location have been researched. The adopted interpolation procedure for wind vector includes three steps: 1) resolve the existing wind vectors, 2) interpolate based on the resolved wind vectors using inverse distance weighted interpolation, and 3) compose the interpolated wind vectors. This paper also presents a new measuring method and its theoretical basis to acquire the distance from sand source to the affected location. This paper claims that the distance along the wind direction, based on which the range of the damage can be acquired, is more valuable for the damage evaluation. The presented method has been applied to three regions of Southern Xinjiang, China.
APA, Harvard, Vancouver, ISO, and other styles
8

Lin, Jyh-Shyan, Jen-Chun Chang, Rong-Jaye Chen, and Torleiv Klove. "Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations." IEEE Transactions on Information Theory 54, no. 3 (March 2008): 1334–39. http://dx.doi.org/10.1109/tit.2007.915706.

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

Matsui, Muneya, Thomas Mikosch, and Gennady Samorodnitsky. "Distance covariance for stochastic processes." Probability and Mathematical Statistics 37, no. 2 (May 14, 2018): 355–72. http://dx.doi.org/10.19195/0208-4147.37.2.9.

Full text
Abstract:
DISTANCE COVARIANCE FOR STOCHASTIC PROCESSESThe distance covariance of two random vectors is a measure of their dependence. The empirical distance covariance and correlation can be used as statistical tools for testing whether two random vectors are independent. We propose an analog of the distance covariance for two stochastic processes defined on some interval. Their empirical analogs can be used to test the independence of two processes.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Peng, Xiaogang Wang, and Peter X. K. Song. "Clustering Categorical Data Based on Distance Vectors." Journal of the American Statistical Association 101, no. 473 (March 2006): 355–67. http://dx.doi.org/10.1198/016214505000000312.

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

Dissertations / Theses on the topic "Distance vectors"

1

Shaik, Abdul Ameer Basha. "SVM Classification and Analysis of Margin Distance on Microarray Data." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1302618924.

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

Hjelm, Andersson Patrick. "Binär matchning av bilder med hjälp av vektorer från deneuklidiska avståndstransformen." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2440.

Full text
Abstract:

This thesis shows the result from investigations of methods that use distance vectors when matching pictures. The distance vectors are available in a distance map made by the Euclidean Distance Transform. The investigated methods use the two characteristic features of the distance vector when matching pictures, length and direction. The length of the vector is used to calculate a value of how good a match is and the direction of the vector is used to predict a transformation to get a better match. The results shows that the number of calculation steps that are used during a search can be reduced compared to matching methods that only uses the distance during the matching.

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

Visa, Sofia. "Comparative Study of Methods for Linguistic Modeling of Numerical Data." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1043254774.

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

Thomson, R. G. W. "Vector acoustic miss distance indication." Master's thesis, University of Cape Town, 1985. http://hdl.handle.net/11427/21868.

Full text
Abstract:
In 1981 the author decided to investigate means of accurately measuring the passage of anti-aircraft shells past a towed airborne target. This decision was based on the observation that available literature showed a need for low cost miss distance indication equipment. A feasibility study showed that the task would be multi-disciplinary entailing aerodynamics telemetry, weapons performance studies and investigation of the techniques of measurement of shell location currently in use. The decision was made by the author to concentrate on a study of the technique measurements of shell location and the analysis of such measurements in view of the fact that, at least in isolation, knowledge of the other factors mentioned was fairly complete although unevenly spread in South Africa. Initial work concerned a study of the General Requirements for such target systems and the classification of these. A literature survey was conducted by the author which indicated that systems already in service made use of several measurement techniques, including photographic, radar and acoustic phenomena. Of these, acoustic means appeared to offer a cheap and simple solution to the measurement problem. The author then explored the principles and potential of Acoustic Miss Distance indication and arrived at the conclusion that such a system, based on measurements of the period of the shockwave accompanying a supers6nic shell, would be feasible. This conclusion led to the Thesis presented in this document, that firstly measurement of the shock-wave period could enable deduction of the distance between the sensor and the flight path of a supersonic shell and secondly, that several such measurements would enable the miss vector to be calculated.
APA, Harvard, Vancouver, ISO, and other styles
5

Girard, Jean-François. "Failure tolerant alternate-path distance-vector routing." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61200.

Full text
Abstract:
In the Alternate-path Distance-vector Routing approach presented by Tsuchiya (?) each node of a network keeps enough information to route messages after a failure. This thesis presents an algorithm to update this information in reaction to link failures. The proposed algorithm appears to perform its task without introducing a count to infinity problem. This thesis also presents a way to reduce the size of one of the most frequently sent messages. The size of this message can be reduced by up to 50% of its equivalent in the Tsuchiya approach. The algorithm was tested on a simulated networks consisting of 98 nodes representative of the ARPANET (1983). The results obtained show that the algorithm displays reasonable performance in the context of hop count metrics.
APA, Harvard, Vancouver, ISO, and other styles
6

Fang, Xiao Ph D. Massachusetts Institute of Technology. "Bayesian distance metric learning on i-vector for speaker verification." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84870.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 63-66).
This thesis explores the use of Bayesian distance metric learning (Bayes_dml) for the task of speaker verification using the i-vector feature representation. We propose a framework that explores the distance constraints between i-vector pairs from the same speaker and different speakers. With an approximation of the distance metric as a weighted covariance matrix of the top eigenvectors from the data covariance matrix, variational inference is used to estimate a posterior distribution of the distance metric. Given speaker labels, we select different-speaker data pairs with the highest cosine scores to form a different-speaker constraint set. This set captures the most discriminative between-speaker variability that exists in the training data. This system is evaluated on the female part of the 2008 NIST SRE dataset. Cosine similarity scoring, as the state-of-the-art approach, is compared to Bayes-dml. Experimental results show the comparable performance between Bayes_dml and cosine similarity scoring. Furthermore, Bayes-dml is insensitive to score normalization, as compared to cosine similarity scoring. Without the requirement of the number of labeled examples, Bayes_dml performs better in the context of limited training data
by Xiao Fang.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Miško, Lukáš. "Optimalizace směrování v protokolu Ad hoc On-Demand Distance Vector." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413102.

Full text
Abstract:
This thesis contains a theoretical basis for MANET networks. The main focus of the thesis is principles of these networks, their routing protocols and especially on Ad hoc On-Demand Distance Vector (AODV), implementation of this protocol and implementation of new mechanis for peer selection. Thesis contains ETX metric basic and implementation of this metric to AODV protocol. There is a demonstration of simulation of AODV protocol and simulation of AODV-ETX protocol. Simulations are run in Network Simulator 3. AODV and AODV-ETX comparasion are included in thesis.
APA, Harvard, Vancouver, ISO, and other styles
8

Eerla, Vishwa Shanthi. "Multi-Criteria Mapping Based on Support Vector Machine and Cluster Distance." Master's thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-212565.

Full text
Abstract:
There was an increase in a number of applications for a master degree program with the growth in time. It takes huge time to process all the application documents of each and every applicant manually and requires a high volume of the workforce. This can be reduced if automation is used for this process. In any case, before that, an analysis of the complete strides required in preparing was precisely the automation must be utilized to diminish the time and workforces must be finished. The application process for the applicant is actually participating in several steps. First, the applicant sends the complete scanned documents to the uni-assist; from there the applications are received by the student assistant team at the particular university to which the applicant had applied, and then they are sent to the individual departments. At the individual sections, the individual applications will be handled by leading an intensive study to know whether the applicant by their past capabilities scopes to satisfy the prerequisites of further study system to which they have applied. What's more, by considering the required points of interest of the applicant without investigating every single report, and to pack the information and diminish the preparing time for the specific division, by this postulation extend a solitary web apparatus is being produced that can procedure the application which is much dependable in the basic leadership procedure of application.
APA, Harvard, Vancouver, ISO, and other styles
9

Du, Plessis Johan. "ACODV : Ant Colony Optimisation Distance Vector routing in ad hoc networks." Diss., University of Pretoria, 2005. http://hdl.handle.net/2263/23923.

Full text
Abstract:
A mobile ad hoc network is a collection of wireless mobile devices which dynamically form a temporary network, without using any existing network infrastructure or centralised administration. Each node in the network effectively becomes a router, and forwards packets towards the packet’s destination node. Ad hoc networks are characterized by frequently changing network topology, multi-hop wireless connections and the need for dynamic, efficient routing protocols.
  • The overarching requirement for low power consumption, as battery powered sensors may be required to operate for years without battery replacement;
  • An emphasis on reliable communication as opposed to real-time communication, it is more important for packets to arrive reliably than to arrive quickly; and
  • Very scarce processing and memory resources, as these sensors are often implemented on small low-power microprocessors.
  • This work provides overviews of routing protocols in ad hoc networks, swarm intelligence, and swarm intelligence applied to ad hoc routing. Various mechanisms that are commonly encountered in ad hoc routing are experimentally evaluated under situations as close to real-life as possible. Where possible, enhancements to the mechanisms are suggested and evaluated. Finally, a routing protocol suitable for such low-power sensor networks is defined and benchmarked in various scenarios against the Ad hoc On-Demand Distance Vector (AODV) algorithm.
    Dissertation (MSc)--University of Pretoria, 2005.
    Computer Science
    Unrestricted
    APA, Harvard, Vancouver, ISO, and other styles
    10

    Trhlík, Jiří. "Modelování distance-vektor směrovacích protokolů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-235460.

    Full text
    Abstract:
    This master thesis deals with the implementation of the RIPng routing protocol in the OMNeT++/INET environment. It describes the RIPng protocol and its specifics on the Cisco devices. It clarifies important concepts such as IPv6 and distance-vector routing protocols. The thesis also describes the OMNeT++ environment and the INET Framework, where it focuses on the current status of implementation of the components required for the RIPng protocol integration.
    APA, Harvard, Vancouver, ISO, and other styles
    More sources

    Books on the topic "Distance vectors"

    1

    Islei, Gerd. An approach to preference vector derivation using least square distance. Manchester: Manchester Business School, 1986.

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

    Islei, Gerd. An approach to measuring consistency of preference vector derivations using least square distance. Manchester: Manchester Business School, 1986.

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

    Wittman, David M. Spacetime Geometry. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199658633.003.0011.

    Full text
    Abstract:
    This chapter shows that the counterintuitive aspects of special relativity are due to the geometry of spacetime. We begin by showing, in the familiar context of plane geometry, how a metric equation separates frame‐dependent quantities from invariant ones. The components of a displacement vector depend on the coordinate system you choose, but its magnitude (the distance between two points, which is more physically meaningful) is invariant. Similarly, space and time components of a spacetime displacement are frame‐dependent, but the magnitude (proper time) is invariant and more physically meaningful. In plane geometry displacements in both x and y contribute positively to the distance, but in spacetime geometry the spatial displacement contributes negatively to the proper time. This is the source of counterintuitive aspects of special relativity. We develop spacetime intuition by practicing with a graphic stretching‐triangle representation of spacetime displacement vectors.
    APA, Harvard, Vancouver, ISO, and other styles
    4

    IP Routing Simulator: Distance Vector Protocols. Macmillan Computer Publishing (a Pearson Education company), 2000.

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

    Cisco, Systems Inc. CISCO Interactive Mentor IP Routing: Distance-Vector Protocols (With CD-ROM). Cisco Press, 2000.

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

    Hrushovski, Ehud, and François Loeser. The space of stably dominated types. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691161686.003.0003.

    Full text
    Abstract:
    This chapter introduces the space unit vector V of stably dominated types on a definable set V. It first endows unit vector V with a canonical structure of a (strict) pro-definable set before providing some examples of stably dominated types. It then endows unit vector V with the structure of a definable topological space, and the properties of this definable topology are discussed. It also examines the canonical embedding of V in unit vector V as the set of simple points. An essential feature in the approach used in this chapter is the existence of a canonical extension for a definable function on V to unit vector V. This is considered in the next section where continuity criteria are given. The chapter concludes by describing basic notions of (generalized) paths and homotopies, along with good metrics, Zariski topology, and schematic distance.
    APA, Harvard, Vancouver, ISO, and other styles
    7

    QoS Analysis of AdHoc On-Demand Distance Vector Routing Protocol: Theory and Experimental Analysis by TigerHATS. Germany: LAP Lambert Academic Publishing, 2012.

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

    Simulation and Performance Analysis of the AD HOC On-Demand Distance Vector Routing Protocol for Tactical Mobile AD HOC Networks. Storming Media, 2000.

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

    Mann, Peter. Energy and Work. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198822370.003.0002.

    Full text
    Abstract:
    This chapter discusses the work–energy theorem, which is developed from Newton’s second law, and defines the kinetic and potential energies of the system. While there is some vector calculus involved, it has been kept to the bare minimum and the reader should not require in-depth knowledge to understand the salient points. If there is a net force on the particle, it accelerates in the direction of the unbalanced force. The force is a central force if it depends only on the distance between the point on which the force acts and the coordinate origin. Using Stokes’s theorem, potential energies are thoroughly discussed. The chapter also discusses spherically symmetric potentials, isotropic force, force on systems of particles, centre of mass coordinates and rigid bodies.
    APA, Harvard, Vancouver, ISO, and other styles
    10

    Gozlan, Rodolphe E., and Marine Combe. Environmental change and pathogen transmission. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198789833.003.0005.

    Full text
    Abstract:
    The majority of emerging pathogens has an environmental origin. These pathogens are increasing in incidence and geographic distribution. Because of the continuous worldwide population growth, and global changes, the emergence of pathogens will continue to intensify, particularly in tropical areas where demographic growth is uncontrolled and socioeconomic and environmental changes rapid. Using a set of case studies, we look at the role of biodiversity alteration on zoonoses emergence and transmission routes, as well as the existing links between climate variability and pathogen emergence. Pathogen emergence and transmission are closely associated with habitat alterations and vector or host-species changes. Because of environmental changes, pathogens that were previously in a dynamic equilibrium, with local host communities in a pristine habitat, without human contact, are now redistributed locally, and over long distances, owing to increasing global pathways. Thus, we aim to characterize the environmental determinants of pathogen transmission in the tropics.
    APA, Harvard, Vancouver, ISO, and other styles

    Book chapters on the topic "Distance vectors"

    1

    Ekinci, Murat, and Eyup Gedikli. "Gait Recognition Using View Distance Vectors." In Computational Intelligence and Security, 973–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596448_144.

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

    Aharonov, Yakir, and Lev Vaidman. "Protective Measurements of Two-State Vectors." In Potentiality, Entanglement and Passion-at-a-Distance, 1–8. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-017-2732-7_1.

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

    Lyubashevsky, Vadim, and Daniele Micciancio. "On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem." In Advances in Cryptology - CRYPTO 2009, 577–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03356-8_34.

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

    Naor, Assaf, and Krzysztof Oleszkiewicz. "Moments of the Distance Between Independent Random Vectors." In Lecture Notes in Mathematics, 229–56. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46762-3_10.

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

    Li, Baoqing. "Distance-Based Selection of Potential Support Vectors by Kernel Matrix." In Advances in Neural Networks – ISNN 2004, 468–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28647-9_78.

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

    Ni, Tongguang, Zongyuan Ding, Fuhua Chen, and Hongyuan Wang. "Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-identification." In Communications in Computer and Information Science, 482–93. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-7299-4_40.

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

    Nielsen, B., F. Albregtsen, and H. E. Danielsen. "Fractal Signature Vectors and Lacunarity Class Distance Matrices to Extract New Adaptive Texture Features from Cell Nuclei." In Fractals in Biology and Medicine, 55–65. Basel: Birkhäuser Basel, 2002. http://dx.doi.org/10.1007/978-3-0348-8119-7_6.

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

    Bielecki, Włodzimierz, Krzysztof Kraska, and Tomasz Klimek. "Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm." In Combinatorial Optimization and Applications, 129–40. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03780-6_12.

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

    Amin, Kaizar A., John T. Mayes, and Armin R. Mikler. "Agent-Based Distance Vector Routing." In Lecture Notes in Computer Science, 41–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44651-6_5.

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

    Carrizosa, Emilio. "Support vector machines and distance minimization." In CRM Proceedings and Lecture Notes, 1–13. Providence, Rhode Island: American Mathematical Society, 2008. http://dx.doi.org/10.1090/crmp/045/01.

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

    Conference papers on the topic "Distance vectors"

    1

    Drakakis, Konstantinos, Rod Gow, and Scott Rickard. "Distance vectors in Costas arrays." In 2008 42nd Annual Conference on Information Sciences and Systems (CISS). IEEE, 2008. http://dx.doi.org/10.1109/ciss.2008.4558707.

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

    Chang, Jen-Chun, and Hsin-Lung Wu. "Distance-increasing mappings from binary vectors to constant composition vectors." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5206023.

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

    Niwa, Yoshiki, and Yoshihiko Nitta. "Co-occurrence vectors from corpora vs. distance vectors from dictionaries." In the 15th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1994. http://dx.doi.org/10.3115/991886.991938.

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

    Chang, J. C., R. J. Chen, and S. C. Tsai. "Distance preserving mappings from binary vectors to permutations." In IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228028.

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

    Nurges, U., and E. Rustern. "The distance from stability boundary and reflection vectors." In Proceedings of 2002 American Control Conference. IEEE, 2002. http://dx.doi.org/10.1109/acc.2002.1024539.

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

    Kuo, Huang-Cheng, Pei-Yuan Jou, and Jen-Peng Huang. "Adaptive Weighting Distance for Feature Vectors of Biological Sequences." In 2007 International Conference on Machine Learning and Cybernetics. IEEE, 2007. http://dx.doi.org/10.1109/icmlc.2007.4370523.

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

    Yaqin, Guo, and Wang Zhengqun. "Support vectors pre-extracting method based on boundary distance." In 2016 IEEE International Conference on Mechatronics and Automation. IEEE, 2016. http://dx.doi.org/10.1109/icma.2016.7558876.

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

    Sooksatra, Sorn, Toshiaki Kondo, and Pished Bunnun. "A drowsiness detection method using distance and gradient vectors." In 2015 6th International Conference of Information and Communication Technology for Embedded Systems (IC-ICTES). IEEE, 2015. http://dx.doi.org/10.1109/ictemsys.2015.7110812.

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

    Cicalese, Ferdinando, Luisa Gargano, and Ugo Vaccaro. "Approximating probability distributions with short vectors, via information theoretic distance measures." In 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, 2016. http://dx.doi.org/10.1109/isit.2016.7541477.

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

    Sooksatra, Sorn, Toshiaki Kondo, and Pished Bunnun. "A robust method for drowsiness detection using distance and gradient vectors." In 2015 12th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON). IEEE, 2015. http://dx.doi.org/10.1109/ecticon.2015.7206977.

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

    Reports on the topic "Distance vectors"

    1

    Waitzman, D., C. Partridge, and S. E. Deering. Distance Vector Multicast Routing Protocol. RFC Editor, November 1988. http://dx.doi.org/10.17487/rfc1075.

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

    Perkins, C., E. Belding-Royer, and S. Das. Ad hoc On-Demand Distance Vector (AODV) Routing. RFC Editor, July 2003. http://dx.doi.org/10.17487/rfc3561.

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

    Linn, Robert L., Stephen B. Dunbar, and Eva L. Baker. Psychometric Issues Related to the Five-Vector Model: Knowledge, Models and Tools to Improve the Effectiveness of Naval Distance Learning. Fort Belvoir, VA: Defense Technical Information Center, June 2006. http://dx.doi.org/10.21236/ada450134.

    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!

    To the bibliography