Publications

Found 4214 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 
B
Popa, L., Rostami A.., Karp R. M., Papadimitriou C. H., & Stoica I. (2007).  Balancing the Traffic Load in Wireless Networks with Curveball Routing. Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2007).
Feldman, J. (1975).  Bad-Mouthing Frames.
Seidel, R.. (1992).  Backwards Analysis of Randomized Geometric Algorithms.
Portnoff, R. S., Huang D. Yuxing, Doerfler P., Afroz S., & McCoy D. (2017).  Backpage and Bitcoin: Uncovering Human Traffickers. Proceedings of KDD 2017.
Ji, G., & Bilmes J. A. (2006).  Backoff Model Training Using Partially Observed Data: Application to Dialog Act Tagging. Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL 2006). 280-287.
Fillmore, C. J., Johnson C. R., & Petruck M. R. L. (2003).  Background to Framenet. International Journal of Lexicography. 235-250.
Miller, B., Kantchelian A., Tschantz M. Carl, Afroz S., Bachwani R., Faizullabhoy R., et al. (2015).  Back to the Future: Malware Detection with Temporally Consistent Labels. CoRR. abs/1510.07338,
A
Zarchy, D., Mittal R., Schapira M., & Shenker S. J. (2019).   Axiomatizing Congestion Control. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 3(2), 
Wernicke, S., Alber J., Gramm J., Guo J., & Niedermeier R. (2004).  Avoiding Forbidden Submatrices by Row Deletions. 2832, 349-360.
Yeom, S., & Tschantz M. (2021).  Avoiding Disparity Amplification under Different Worldviews. FAccT '21: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency. 273-283.
Devarakonda, A., Fountoulakis K., Demmel J., & Mahoney M. W. (2016).  Avoiding communication in primal and dual block coordinate descent methods.
Ajwani, D.., & Friedrich T. (2010).  Average-Case Analysis of Incremental Topological Ordering. Discrete Applied Mathematics. 158(4), 240-250.
Friedrich, T., & Hebbinghaus N. (2008).  Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. 693-704.
Moulin, H., & Shenker S. J. (1994).  Average Cost Pricing Versus Serial Cost Sharing: An Axiomatic Comparison. Journal of Economic Theory. 64(1), 178-201.
Pucci, G., & Zimmermann W. (1991).  On the Average Case Complexity of Parallel Sublist Selection.
Alberts, D., & Henzinger M. Rauch (1995).  Average Case Analysis of Dynamic Graph Algorithms.
Karp, R. M., Kan A.. H. G. Rinn, & Vohra R.. V. (1994).  Average case analysis of a heuristic for the assignment problem. Mathematics of Operations Research. 19(3), 513-522.
Albers, S., & Mitzenmacher M. (1995).  Average Case Analyses of List Update Algorithms, with Applications to Data Compression.
Azadi, S., Feng J., Jegelka S., & Darrell T. (2015).  Auxiliary Image Regularization for Deep CNNs with Noisy Labels. CoRR. abs/1511.07069,
Ganapathy, S., Motlicek P., Hermansky H., & Garudadri H. (2008).  Autoregressive Modeling of Hilbert Envelopes for Wide-Band Audio Coding.
Satzger, B., Pietzowski A., & Ungerer T. (2011).  Autonomous and Scalable Failure Detection in Distributed Systems. International Journal of Autonomous and Adaptive Communications Systems. 4(1), 61-77.
Li, Z., Goyal A., Chen Y., & Paxson V. (2009).  Automating Analysis of Large-Scale Botnet Probing Events. 11-22.
Bhagat, S., Carvey H., & Shriberg E. (2003).  Automatically Generated Prosodic Cues to Lexically Ambiguous Dialog Acts in Multiparty Meetings. Proceedings of the 15th International Congress of Phonetic Sciences (ICPhS 2003).
Zimmermann, W. (1990).  Automatic Worst Case Complexity Analysis of Parallel Programs.
Zimmermann, W. (1991).  The Automatic Worst Case Analysis of Parallel Programs: Single Parallel Sorting and Algorithms on Graphs.

Pages