Sciweavers

7106 search results - page 1170 / 1422
» Restricted Complexity, General Complexity
Sort
View
POPL
2009
ACM
16 years 6 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 6 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
KDD
2008
ACM
284views Data Mining» more  KDD 2008»
16 years 6 months ago
Community evolution in dynamic multi-mode networks
A multi-mode network typically consists of multiple heterogeneous social actors among which various types of interactions could occur. Identifying communities in a multi-mode netw...
Lei Tang, Huan Liu, Jianping Zhang, Zohreh Nazeri
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 6 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 6 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
« Prev « First page 1170 / 1422 Last » Next »