4112 search results - page 823 / 823 » Efficient Algorithms for the Spoonerism Problem |
STOC
2003
ACM
14 years 11 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...