178 search results - page 34 / 36 » Fast Algorithms for Top-k Approximate String Matching |
CIVR
2007
Springer
14 years 13 days ago
2007
Springer
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
KDD
2005
ACM
14 years 6 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
SIGCOMM
2006
ACM
14 years 6 days ago
2006
ACM
Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like F...
BMCBI
2008
13 years 6 months ago
2008
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...