Listing 1 - 6 of 6 |
Sort by
|
Choose an application
Data structures (Computer science) --- Sorting (Electronic computers) --- Recursive programming --- Linear programming --- Computer sorting --- Electronic data processing --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science)
Choose an application
In plain, uncomplicated language, and using detailed examples to explain the key concepts, models, and algorithms in vertical search ranking, Relevance Ranking for Vertical Search Engines teaches readers how to manipulate ranking algorithms to achieve better results in real-world applications. This reference book for professionals covers concepts and theories from the fundamental to the advanced, such as relevance, query intention, location-based relevance ranking, and cross-property ranking. It covers the most recent developments in vertical search ranking applications, such
Text processing (Computer science) --- Sorting (Electronic computers) --- Relevance --- Database searching --- Search engines --- Engineering & Applied Sciences --- Computer Science --- Programming --- Relevance. --- Database searching. --- Programming. --- Computer programming --- Data base searching --- Database search strategies --- Search strategies in databases --- Searching databases --- Electronic information resource searching --- Pertinence --- Relevancy --- Meaning (Philosophy) --- Meaning (Psychology) --- Computer sorting --- Electronic data processing --- Processing, Text (Computer science) --- Database management --- Information storage and retrieval systems --- Word processing
Choose an application
Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner. This book also outlines new ideas and techniques for designing faster sorting networks using Sortnet, and illustrates how these techniques were used to design faster 12-key and 18-key sorting networks through a series of case studies. Finally, it examines and explains the mysterious behavior exhibited by the fastest-known 9-step 16-key network. Designing Sorting Networks: A New Paradigm is intended for advanced-level students, researchers and practitioners as a reference book. Academics in the fields of computer science, engineering and mathematics will also find this book invaluable.
Data structures (Computer science). --- Parallel processing (Electronic computers). --- Sorting (Electronic computers). --- Sorting (Electronic computers) --- Data structures (Computer science) --- Parallel processing (Electronic computers) --- Engineering & Applied Sciences --- Computer Science --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Computer sorting --- Computer science. --- Arithmetic and logic units, Computer. --- Computers. --- Computer Science. --- Data Structures. --- Arithmetic and Logic Structures. --- Models and Principles. --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science)
Choose an application
Programming --- Sorting (Electronic computers) --- Tri (Informatique) --- 681.3*E1 --- 681.3*F22 --- Computer sorting --- Electronic data processing --- Data structures: arrays; graphs; lists; tables; trees --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Computerprogrammering: sorteren --- Programmeren --- Sorting (Electronic computers). --- Computerprogrammering: sorteren. --- Programmeren. --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees
Choose an application
Sorting (Electronic computers) --- PL/I (Computer program language) --- Tri (Informatique) --- PL/I (Langage de programmation) --- 681.3*E1 --- 681.3*F22 --- Computer sorting --- Electronic data processing --- PL/1 (Computer program language) --- PL/one (Computer program language) --- Programming language 1 (Computer program language) --- Programming language I (Computer program language) --- Programming language one (Computer program language) --- Data structures: arrays; graphs; lists; tables; trees --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees
Choose an application
Parallel processing (Electronic computers) --- Sorting (Electronic computers) --- Parallel algorithms --- 681.3*C12 --- 681.3*F22 --- Computer sorting --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures computations on discrete structures geometrical problems and computations pattern matching --See also {?681.3*E2-5} {681.3*G2} {?681.3*H2-3} --- Nonnumerical algorithms and problems: complexity of proof procedures computations on discrete structures geometrical problems and computations pattern matching --See also {?681.3*E2-5} {681.3*G2} {?681.3*H2-3} --- 681.3*C12 Multiple data stream architectures (multiprocessors): MIMD SIMD pipeline and parallel processors array-, vector-, associative processors interconnection architectures: common bus, multiport memory, crossbar switch --- Multiple data stream architectures (multiprocessors): MIMD SIMD pipeline and parallel processors array-, vector-, associative processors interconnection architectures: common bus, multiport memory, crossbar switch --- Algorithms --- Electronic data processing --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 681.3*C12 Multiple data stream architectures (multiprocessors): MIMD; SIMD; pipeline and parallel processors; array-, vector-, associative processors; interconnection architectures: common bus, multiport memory, crossbar switch --- Multiple data stream architectures (multiprocessors): MIMD; SIMD; pipeline and parallel processors; array-, vector-, associative processors; interconnection architectures: common bus, multiport memory, crossbar switch --- Computer science
Listing 1 - 6 of 6 |
Sort by
|