Adversary model

Results: 85



#Item
1Competitive Online Algorithms Susanne Albers Overview  arrive one by one and must be scheduled immediately

Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:09:17
2Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS  Jan Bul´anek

Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS Jan Bul´anek

Add to Reading List

Source URL: iuuk.mff.cuni.cz

Language: English - Date: 2014-07-29 07:02:19
3Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:02
4C:/Users/Bin Zan/Dropbox/typeinst/IEEE6page.dvi

C:/Users/Bin Zan/Dropbox/typeinst/IEEE6page.dvi

Add to Reading List

Source URL: www.winlab.rutgers.edu

Language: English - Date: 2011-07-31 11:03:34
5The 2011 Military Communications Conference - Track 3 - Cyber Security and Network Operations  Multi-node Coordinated Jamming for Location Privacy Protection Sangho Oh

The 2011 Military Communications Conference - Track 3 - Cyber Security and Network Operations Multi-node Coordinated Jamming for Location Privacy Protection Sangho Oh

Add to Reading List

Source URL: www.winlab.rutgers.edu

Language: English - Date: 2012-01-16 23:23:23
6The proceedings version of this paper appears in ACM CCSThis is the full version of that paper.  Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗

The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2007-08-20 03:37:31
7Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-02 15:13:55
8Dynamic Internet Congestion with Bursts Stefan Schmid1 and Roger Wattenhofer2 1 2

Dynamic Internet Congestion with Bursts Stefan Schmid1 and Roger Wattenhofer2 1 2

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:53
9Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:28
10Mach Learn: 69–83 DOIs10994Mining adversarial patterns via regularized loss minimization Wei Liu · Sanjay Chawla

Mach Learn: 69–83 DOIs10994Mining adversarial patterns via regularized loss minimization Wei Liu · Sanjay Chawla

Add to Reading List

Source URL: pmg.it.usyd.edu.au

Language: English - Date: 2011-03-12 02:03:54