Sciweavers

1405 search results - page 161 / 281
» Popularity at Minimum Cost
Sort
View
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 8 months ago
Direct mining of discriminative patterns for classifying uncertain data
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
Chuancong Gao, Jianyong Wang
FOCS
2000
IEEE
15 years 8 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
CCS
2010
ACM
15 years 4 months ago
Demonstrating cognitive packet network resilience to worm attacks
The need for network stability and reliability has led to the growth of autonomic networks [2] that can provide more stable and more reliable communications via on-line measuremen...
Georgia Sakellari, Erol Gelenbe
IANDC
2008
92views more  IANDC 2008»
15 years 4 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
COMCOM
2006
154views more  COMCOM 2006»
15 years 4 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia