Sciweavers

666 search results - page 118 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
BMCBI
2007
129views more  BMCBI 2007»
13 years 7 months ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl
MMMACNS
2010
Springer
13 years 6 months ago
Group-Centric Models for Secure and Agile Information Sharing
Abstract. To share information and retain control (share-but-protect) is a classic cyber security problem for which effective solutions continue to be elusive. Where the patterns o...
Ravi S. Sandhu, Ram Krishnan, Jianwei Niu, William...
MOBISEC
2009
Springer
14 years 2 months ago
Filtering SPAM in P2PSIP Communities with Web of Trust
Spam is a dominant problem on email systems today. One of the reasons is the lack of infrastructure for security and trust. As Voice over IP (VoIP) communication becomes increasing...
Juho Heikkilä, Andrei Gurtov
IMC
2006
ACM
14 years 1 months ago
Quantifying path exploration in the internet
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
Ricardo V. Oliveira, Beichuan Zhang, Dan Pei, Rafi...