Sciweavers

16626 search results - page 3239 / 3326
» Computing is a natural science
Sort
View
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 2 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 2 months ago
Enhanced word clustering for hierarchical text classification
In this paper we propose a new information-theoretic divisive algorithm for word clustering applied to text classification. In previous work, such "distributional clustering&...
Inderjit S. Dhillon, Subramanyam Mallela, Rahul Ku...
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
16 years 2 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
VLSID
2006
IEEE
142views VLSI» more  VLSID 2006»
16 years 1 months ago
Impact of Configurability and Extensibility on IPSec Protocol Execution on Embedded Processors
- Security protocols, such as IPSec and SSL, are being increasingly deployed in the context of networked embedded systems. The resource-constrained nature of embedded systems and, ...
Nachiketh R. Potlapally, Srivaths Ravi, Anand Ragh...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 1 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
« Prev « First page 3239 / 3326 Last » Next »