Sciweavers

3257 search results - page 612 / 652
» Some Results on Effective Randomness
Sort
View
WWW
2006
ACM
15 years 10 months ago
Time-dependent semantic similarity measure of queries using historical click-through data
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the...
Qiankun Zhao, Steven C. H. Hoi, Tie-Yan Liu, Soura...
WWW
2004
ACM
15 years 10 months ago
An agent system reasoning about the web and the user
The paper describes some innovations related to the ongoing work on the GSA prototype, an integrated information retrieval agent. In order to improve the original system effective...
Giovambattista Ianni, Francesco Ricca, Francesco C...
ICFP
2009
ACM
15 years 10 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...
CCS
2009
ACM
15 years 10 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
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf