2127 search results - page 29 / 426 » Computing large matchings fast |
101
click to vote
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
APBC
2007
14 years 11 months ago
2007
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
CLUSTER
2003
IEEE
15 years 3 months ago
2003
IEEE
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
RECONFIG
2008
IEEE
15 years 4 months ago
2008
IEEE
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...