240 search results - page 11 / 48 » Efficient Variants of the Backward-Oracle-Matching Algorithm |
DAC
2001
ACM
14 years 9 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
TDSC
2010
13 years 3 months ago
2010
Although recent estimates are speaking of 200,000 different viruses, worms, and Trojan horses, the majority of them are variants of previously existing malware. As these variants m...
GIS
2006
ACM
14 years 9 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
RECOMB
1997
Springer
14 years 22 days ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
CTRSA
2007
Springer
14 years 16 days ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...