Sciweavers

36 search results - page 3 / 8
» Hash Functions Based on Large Quasigroups
Sort
View
ICMCS
2010
IEEE
178views Multimedia» more  ICMCS 2010»
14 years 10 months ago
Optimal configuration of hash table based multimedia fingerprint databases using weak bits
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...
Claus Bauer, Regunathan Radhakrishnan, Wenyu Jiang
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
15 years 4 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
KIVS
2005
Springer
15 years 3 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
14 years 8 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
FMCAD
2004
Springer
15 years 1 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios