Bures, MG, Martin, YC, Willett, P (1994) Searching techniques for databases of three-dimensional chemical structures. Topics in Stereochemistry 21: pp. 467-511Bures, M. G., Martin, Y. C. & Willet, P. (1994). Searching techniques for databases of three-dimensional chemical structures. ...
Figure 2-8 Basic hashing techniques Hashing methods Hashing methods 28 西南财经大学天府学院 Direct method Direct method The key is the address(an element a key , no synonyms) Example1: total monthly sales by the days of the months Create an array of 31accumulator...
function (edit distance) in general metric spaces, which is expensive to compute. Indexing techniques can be used reduce the number of distance computations. We present an analysis of various existing similarity index- ing structures for the same. The performance obtained ...
Advanced techniques are required just to make the search space finite. We examine some of these methods in Chapter 25. In addition to the complexity of the problem, real robots must also deal with errors in their sensor readings and motor controls. Automatic assembly sequencing of complex ...
meyer - 1992 () Citation Context ...ants of semi-splaying are compared theoretically), other articles compare the practical performance of splaying with other balancing techniques and modifications of splay trees for integer keys (e.g. =-=[1, 2, 5, 6]-=-) or more specialized data [8]...
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor), for displaying information to the user and a keyboard and a pointing device...
“Longest Prefix Matching Using Bloom Filters,” by Dharmapurikar, Krishnamurthy and Taylor, Member, IEEE, in IEEE/ACM Transactions on Networking, vol. 14, No. 2, Apr. 2006, 13 pages. “New Techniques for Private Stream Searching,” by Bethencourt and Song (Carnegie Mellon University) and ...
In a second step, the inherent semantics of such structures would have to be exploited by expressive search techniques that go beyond today's keyword search paradigm. This work proposes a wide variety of novel search and ranking strategies over data that is organized in entity-relations...
To illustrate the techniques, I will assumeunsigned charis 8-bits,unsigned short intis 16-bits, andunsigned long intis 32-bits. ·Division method (tablesize = prime).This technique was used in the preceding example. AHashValue, from 0 to (HashTableSize - 1), is computed by dividing the ...
20100185672TECHNIQUES FOR SPATIAL REPRESENTATION OF DATA AND BROWSING BASED ON SIMILARITYJuly, 2010Rising III 20140207739RECONSTRUCTION OF SYSTEM DEFINITIONAL AND STATE INFORMATIONJuly, 2014Johnson et al. 20140372458Systems and Methods for Mapping Nodes of Disconnected GraphsDecember, 2014Jurca ...