1272 search results - page 91 / 255 » Approximate Parameterized Matching |
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—Phishing has been easy and effective way for trickery and deception on the Internet. While solutions such as URL blacklisting have been effective to some degree, their reliance ...
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
ICPR
2006
IEEE
16 years 13 days ago
2006
IEEE
Regeneration of biometric templates from match scores has security and privacy implications related to any biometric based authentication system. In this paper, we propose a novel...
113
click to vote
SODA
2010
ACM
15 years 8 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
110
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...