Sciweavers

1146 search results - page 202 / 230
» Reconstructing Subsets of Reals
Sort
View
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
15 years 10 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
CCS
2009
ACM
15 years 10 months ago
Hidden credential retrieval from a reusable password
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...
Xavier Boyen
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
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
15 years 10 months ago
Detecting anomalous records in categorical datasets
We consider the problem of detecting anomalies in high arity categorical datasets. In most applications, anomalies are defined as data points that are 'abnormal'. Quite ...
Kaustav Das, Jeff G. Schneider
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
15 years 10 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...