Sciweavers

359 search results - page 61 / 72
» Using graph analysis to study networks of adaptive agent
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
TNN
2011
129views more  TNN 2011»
13 years 2 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
13 years 8 months ago
A Test Paradigm for Detecting Changes in Transactional Data Streams
A pattern is considered useful if it can be used to help a person to achieve his goal. Mining data streams for useful patterns is important in many applications. However, data stre...
Willie Ng, Manoranjan Dash
ATAL
2010
Springer
13 years 8 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
MP
2011
12 years 10 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng