Sciweavers

1565 search results - page 258 / 313
» An unlikely result
Sort
View
WWW
2003
ACM
14 years 9 months ago
Mining topic-specific concepts and definitions on the web
Traditionally, when one wants to learn about a particular topic, one reads a book or a survey paper. With the rapid expansion of the Web, learning in-depth knowledge about a topic...
Bing Liu, Chee Wee Chin, Hwee Tou Ng
WWW
2002
ACM
14 years 9 months ago
Clustering for opportunistic communication
We describe ongoing work on I2I, a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications. U...
Jay Budzik, Shannon Bradshaw, Xiaobin Fu, Kristian...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 9 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
CCS
2009
ACM
14 years 9 months ago
Lightweight self-protecting JavaScript
This paper introduces a method to control JavaScript execution. The aim is to prevent or modify inappropriate behaviour caused by e.g. malicious injected scripts or poorly designe...
Phu H. Phung, David Sands, Andrey Chudnov
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 9 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis