Sciweavers

160 search results - page 29 / 32
» Improved Single and Multiple Approximate String Matching
Sort
View
GPEM
2007
119views more  GPEM 2007»
13 years 6 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
SIGIR
2010
ACM
13 years 6 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
GLOBECOM
2007
IEEE
14 years 1 months ago
Aggregated Bloom Filters for Intrusion Detection and Prevention Hardware
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...
N. Sertac Artan, Kaustubh Sinkar, Jalpa Patel, H. ...
CIKM
2003
Springer
13 years 12 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray