197 search results - page 20 / 40 » Simple deterministic approximation algorithms for counting m... |
CSCLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
SPIRE
1998
Springer
13 years 12 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
INFOCOM
2010
IEEE
13 years 6 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 ...
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...