Publications

Found 701 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is G  [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 
C
Radoslavov, P., Tangmunarunkit H., Yu H., Govindan R., Shenker S., & Estrin D. (2000).  On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design.
Singh, R., Nithyanand R., Afroz S., Tschantz M. Carl, Gill P., & Paxson V. (2017).  Characterizing the Nature and Dynamics of Tor Exit Blocking.. Proceedings of USENIX Security 2017.
Gusella, R. (1990).  Characterizing the Variability of Arrival Processes with Indices of Dispersion.
Ar, S., Blum M. E., Codenotti B., & Gemmell P. (1992).  Checking Approximate Computations Over the Reals.
Ghodsi, A., Zaharia M., Shenker S., & Stoica I. (2013).  Choosy: Max-Min Fair Sharing for Datacenter Jobs with Constraints. 365-378.
Yaman, S., Hakkani-Tür D., Tur G., Grishman R., Harper M. P., McKeown K. R., et al. (2009).  Classification-Based Strategies for Combining Multiple 5-W Question Answering Systems. 2703-2706.
Levchenko, K., Pitsillidis A., Chachra N., Enright B., Felegyhazi M., Grier C., et al. (2011).  Click Trajectories: End-to-End Analysis of the Spam Value Chain. 431-446.
Garg, N. P., Favre B., Riedhammer K., & Hakkani-Tür D. (2009).  ClusterRank: A Graph Based Method for Meeting Summarization. 1499-1502.
Hellerstein, L., Gibson G. A., Karp R. M., Katz R.. M., & Patterson D. (1994).  Coding techniques for handling failures in large disk arrays. Algorithmica. 12(2-3), 182-208.
Genoud, D., Ellis D. P. W., & Morgan N. (1999).  Combined Speech and Speaker Recognition With Speaker-adapted Connectionist Models. Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU-99).
Gao, Y., Beijbom O., Zhang N., & Darrell T. (2016).  Compact Bilinear Pooling. The IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 317-326.
Govil, K., Chan E., & Wasserman H. (1995).  Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU.
Radoslavov, P., Papadopoulos C., Govindan R., & Estrin D. (2004).  A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast. IEEE/ACM Transactions on Networking. 469-482.
Radoslavov, P., Papadopoulos C., Govindan R., & Estrin D. (2001).  A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast. Proceedings of the IEEE Infocom 2001.
He, X., Papadopoulos C., Radoslavov P., & Govindan R. (2001).  A Comparison of Incremental Deployment Strategies for Router-Assisted Reliable Multicast.
Gramm, J., Nierhoff T., Sharan R., & Tantau T. (2004).  On the Complexity of Haplotyping via Perfect Phylogeny. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
Goldreich, O., Ostrovsky R., & Petrank E. (1994).  Computational Complexity and Knowledge Complexity.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.
Gairing, M., Lücking T., Mavronicolas M., & Monien B. (2010).  Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory of Computing Systems. 47(2), 405-432.
Ben-David, Y., Hasan S., Pal J., Vallentin M., Panjwani S.., Gutheim P.., et al. (2011).  Computing Security in the Developing World: A Case for Multidisciplinary Research. 39-44.
Alber, J., Gramm J., Guo J., & Niedermeier R. (2004).  Computing the Similarity of Two Sequences with Nested Arc Annotations. Theoretical Computer Science. 312(2-3), 337-358.
Alber, J., Gramm J., Guo J., & Niedermeier R. (2004).  Computing the Similarity of Two Sequences with Nested Arc Annotations. Theoretical Computer Science. 312(2-3), 337-358.
Feldman, J., Fanty M. A., Goddard N. H., & Lynne K.. J. (1988).  Computing with Structured Connectionist Networks. Communications of the ACM. 31(2), 170-187.
Feldman, J., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
Guesgen, H. Werner (1990).  A Connectionist Approach to Symbolic Constraint Satisfaction.

Pages