Sciweavers

2740 search results - page 407 / 548
» Approximating Component Selection
Sort
View
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
15 years 1 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
MST
2010
93views more  MST 2010»
15 years 1 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
PERCOM
2010
ACM
15 years 1 months ago
All for one or one for all? Combining heterogeneous features for activity spotting
Abstract—Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work ar...
Ulf Blanke, Bernt Schiele, Matthias Kreil, Paul Lu...
GLOBECOM
2010
IEEE
15 years 1 months ago
Know Your Enemy, Know Yourself: Block-Level Network Behavior Profiling and Tracking
Abstract. Gaining a better knowledge of one's own network is crucial to effectively manage and secure today's large, diverse campus and enterprise networks. Because of th...
Esam Sharafuddin, Nan Jiang, Yu Jin, Zhi-Li Zhang
GLOBECOM
2010
IEEE
15 years 1 months ago
Predicting Critical Intradomain Routing Events
Network equipments generate an overwhelming number of reports and alarms every day, but only a small fraction of these alarms require the intervention of network operators. Our goa...
Amelie Medem Kuatse, Renata Teixeira, Nicolas Usun...