Publications

Found 4169 results
Author [ Title(Asc)] 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 
A
Condon, A., & Karp R. M. (1999).  Algorithms for Graph Partitioning on the Planted Partition Model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques.). 221-232.
Kirkpatrick, B., Finucane H., Reshef Y., & Karp R. M. (2010).  Algorithms for Comparing Pedigree Graphs.
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1993).  An Algorithm to Learn Read-Once Threshold Formulas, and Some Generic Transformations Between Learning Models (Revised Version).
Radoslavov, P., & Tokuda T.. (1997).  An Algorithm for Cost-Delay Balanced Trees and Its Application to Wide Area Network Multicast. Proceedings of the First International Conference on Worldwide Computing and Its Applications.
Feldman, J., & Rovner P. D. (1969).  An ALGOL-based Associative Language. Communications of the ACM. 12(8), 439-449.
Feldman, J., & Rovner P. D. (1968).  An ALGOL-based Associative Language.
Feldman, J., & Rovner P. D. (1971).  An ALGOL-based Associative Language.
Blum, L., Cucker F., Shub M., & Smale S. (1996).  Algebraic Settings for the Problem.
Guesgen, H. Werner, & Ladkin P. (1990).  An Algebraic Approach to General Boolean Constraint Problems.
Gittens, A.., Rothauge K.., Mahoney M.. W., Wang S.., Gerhardt L.., Prabhat, et al. (2018).  Alchemist: An Apache Spark <=> MPI Interface. Concurrency and Computation: Practice and Experience (Special Issue of the Cray User Group, CUG 2018), e5026.
Feldman, J., Finkel R. A., Taylor R. H., Bolles R. C., & Paul R. P. (1974).  AL, A Programming System for Automation.
Afroz, S., Biggio B., Carlini N., Elovici Y., & Shabtai A. (2019).  AISec'19: 12th ACM Workshop on Artificial Intelligence and Security. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 2707-2708.
Metere, A. (2019).  AI will never conquer humanity. It’s too rational. Cosmos Magazine.
Rosenfeld, A.., Feldman J., Kanal L.. N., & Winston P.. H. (1977).  AI and Pattern Recognition.
Mahajan, R., Bellovin S. M., Floyd S., Ioannidis J., Paxson V., & Shenker S. (2002).  Aggregate Congestion Control. ACM SIGCOMM Computer Communication Review. 32(1), 69.
Thaler, D., & Handley M. (2000).  On the Aggregatability of Multicast Forwarding State. Proceedings of Infocom 2000.
Feigenbaum, J., Nisan N., Ramachandran V., Sami R., & Shenker S. (2002).  Agents' Privacy In Distributed Algorithmic Mechanisms (Position Paper).
Feldman, J., & Narayanan S. (2014).  Affordances, Actionability, and Simulation.
Maire, M., Narihira T., & Yu S. X. (2016).  Affinity CNN: Learning Pixel-Centric Pairwise Relations for Figure/Ground Embedding. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.
Incer, I., Theodorides M., Afroz S., & Wagner D. (2018).  Adversarially Robust Malware Detection Using Monotonic Classification. Proceedings of IWSPA 2018: 4th ACM International Workshop on Security And Privacy Analytics.
Hwang, J-J., Ke T-W., Shi J., & Yu S. X. (2019).  Adversarial Structure Matching for Structured Prediction Tasks. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.
Donahue, J., Krahenbuhl P., & Darrell T. (2016).  Adversarial Feature Learning. CoRR. abs/1605.09782,
Miller, B., Kantchelian A., Afroz S., Bachwani R., Dauber E., Huang L., et al. (2014).  Adversarial Active Learning. Proceedings of the 2014 Workshop on Artificial Intelligent and Security Workshop (AISec '14). 3–14.
Eddy, W. M., & Allman M. (2000).  Advantages of Parallel Processing and the Effects of Communications Time.

Pages