Discovery and regeneration of hidden emails
Authors:
Open Access
- 13 March 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 503-510
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The maximum edge biclique problem is NP-completeDiscrete Applied Mathematics, 2003
- Email classification for contact centers2003
- Mining newsgroups using networks arising from social behavior2003
- Exploring discussion lists2002
- Reinventing the inbox2002
- Mining e-mail content for author identification forensicsACM SIGMOD Record, 2001
- On Bipartite and Multipartite Clique ProblemsJournal of Algorithms, 2001
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972