993 search results - page 167 / 199 » Supporting cooperative working using shared notebooks |
148
click to vote
MOBICOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
141
Voted
SIGMETRICS
2004
ACM
15 years 9 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
150
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
We describe a new attack against web authentication, which we call dynamic pharming. Dynamic pharming works by hijacking DNS and sending the victim’s browser malicious Javascrip...
124
Voted
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
147
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...