Publications

Found 1116 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
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
Gittens, A.., Rothauge K.., Wang S.., Mahoney M.. W., Gerhardt L.., Prabhat, et al. (2018).  Accelerating Large-Scale Data Analysis by Offloading to High-Performance Computing Libraries using Alchemist. Proceedings of the 24th Annual SIGKDD. 293-301.
Thom, A.., & Kramer O. (2010).  Acceleration of DBSCAN-Based Clustering with Reduced Neighborhood Evaluations. 195-202.
Andersen, D. G., Balakrishnan H., Feamster N., Koponen T., Moon D., & Shenker S. (2008).  Accountable Internet Protocol (AIP). 339-350.
Scott, J., & Karp R. M. (2004).  Achieving Fairness Through Selective Early Dropping.
Kääriäinen, M. (2005).  On Active Learning in the Non-Realizable Case. Proceedings of the Foundations of Active Learning Workshop at the 19th Annual Conference on Neural Information Processing Systems (NIPS).
Monteleoni, C.., & Kääriäinen M. (2005).  Active Learning Under Arbitrary Distributions.
Heo, S., Krashinsky R., & Asanović K. (2007).  Activity-Sensitive Flip-Flop and Latch Selection for Reduced Energy. IEEE Transactions on VLSI Systems. 15(9), 1060-1064.
Thomas, K., Bursztein E., Jagpal N., Rajab M. Abu, Provos N., Pearce P., et al. (2015).  Ad Injection at Scale: Assessing Deceptive Advertisement Modifications.
Saenko, K., Kulis B., Fritz M., & Darrell T. (2010).  Adapting Visual Category Models to New Domains. 213-226.
Satzger, B., Kramer O., & Lässig J. (2010).  Adaptive Heuristic Estimates for Automated Planning Using Regression. 576-581.
Nithyanand, R., Khattak S., Javed M., Vallina-Rodriguez N., Falahrastegar M., Powles J. E., et al. (2016).  Adblocking and Counter-Blocking: A Slice of the Arms Race. Proceedings of the 6th USENIX Workshop on Free and Open Communications on the Internet (FOCI '16).
Fritz, M., Black M., Bradski G., Karayev S., & Darrell T. (2009).  An Additive Latent Feature Model for Transparent Object Recognition.
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Advances in Connectionist Speech Recognition.
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.
Donahue, J., Krahenbuhl P., & Darrell T. (2016).  Adversarial Feature Learning. CoRR. abs/1605.09782,
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.
Rosenfeld, A.., Feldman J., Kanal L.. N., & Winston P.. H. (1977).  AI and Pattern Recognition.
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.
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).
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Kirkpatrick, B., Finucane H., Reshef Y., & Karp R. M. (2010).  Algorithms for Comparing Pedigree Graphs.
Kirkpatrick, B., Finucane H., Reshef Y., & Karp R. M. (2010).  Algorithms for Comparing Pedigree Graphs.
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.
Chandrasekaran, K.., Karp R. M., Moreno-Centeno E.., & Vempala S.. (2011).  Algorithms for Implicit Hitting Set Problems. 614-629.

Pages