Publications

Found 4258 results
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
O
Dreger, H., Feldmann A., Paxson V., & Sommer R. (2004).  Operational Experiences with High-Volume Network Intrusion Detection. Proceedings of the 11th ACM Conference on Computer Communications Security (CCS 2004). 11, 2.
Buller, A. (1995).  Operations on Multimodal Records: Towards a Computational Cognitive Linguistics.
Casado, M., Garfinkel T., Cui W., Paxson V., & Savage S. (2005).  Opportunistic Measurement: Extracting Insight from Spurious Traffic. Proceedings of the Fourth Workshop on Hot Topics in Networks (Hotnets-IV).
Callejo, P., Kelton C., Vallina-Rodriguez N., Cuevas R., Gasser O., Kreibich C., et al. (2017).  Opportunities and Challenges of Ad-based Measurements from the Edge of the Network. Proceedings of HotNets 2017.
Chong, J., Friedland G., Janin A., & Morgan N. (2010).  Opportunities and Challenges of Parallelizing Speech Recognition.
Chinrungrueng, C., & Séquin C. H. (1991).  Optimal Adaptive K-means Algorithm with Dynamic Adjustment of Learning Rate.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Dagum, P., Karp R. M., Luby M., & Ross S. (1995).  An optimal algorithm for Monte Carlo estimation. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 142-149.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte-Carlo Estimation. 29(5), 1484-1496.
Karp, R. M., Vazirani U. V., & Vazirani V. V. (1990).  An optimal algorithm for on-line bipartite matching. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
Shenker, S. J., & Weinrib A. (1989).  The Optimal Control of Heterogeneous Queuing Systems: A Paradigm for Load-Sharing and Routing. IEEE Transactions of Computers. 38(12), 1724-1735.
Heun, V., & Mayr E. W. (1998).  Optimal Dynamic Embeddings of Complete Binary Trees Into Hypercubes.
Karp, R. M., Nierhoff T., & Tantau T. (2005).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005). 225-231.
Karp, R. M., Nierhoff T., & Tantau T. (2006).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. 3895, 111-128.
Shamir, R., & Sharan R. (2004).  Optimal Fully Dynamic Algorithms for Cograph Recognition. 329-340.
Boehme, R., & Felegyhazi M. (2010).  Optimal Information Security Investment with Penetration Testing.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
Luby, M., & Ertel W. (1993).  Optimal Parallelization of Las Vegas Algorithms.
Novak, E. (1993).  Optimal Recovery and n-Widths For Convex Classes of Functions.
Luby, M., Sinclair A., & Zuckerman D. (1993).  Optimal Speedup of Las Vegas Algorithms.
Novak, E., & Petras K. (1993).  Optimal Stochastic Quadrature Formulas For Convex Functions.
Zhu, R., Ma P., Mahoney M., & Yu B. (2015).  Optimal Subsampling Approaches for Large Sample Linear Regression.
Radojković, P., Cakarevic V., Moretó M., Verdú J., Pajuelo A., Cazorla F. J., et al. (2012).  Optimal Task Assignment in Multithreaded Processors: A Statistical Approach. ACM SIGARCH Computer Architecture News. 40(1), 235-248.
Radojković, P., Cakarevic V., Moretó M., Verdú J., Pajuelo A., Cazorla F. J., et al. (2012).  Optimal Task Assignment in Multithreaded Processors: A Statistical Approach. 235-248.
der Heide, F. Meyer auf, Storch M., & Wanka R. (1996).  Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks.

Pages