Publications

Found 416 results
[ Author(Desc)] Title Type Year
Filters: First Letter Of Title is C  [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 
G
Gairing, M. (2009).  Covering Games: Approximation Through Non-Cooperation. 184-195.
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.
Gao, Y., Beijbom O., Zhang N., & Darrell T. (2016).  Compact Bilinear Pooling. The IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 317-326.
Garagnani, M., Shastri L., & Wendelken C. (2001).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 20th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2001).
Garagnani, M., Shastri L., & Wendelken C. (2002).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 24th Annual Conference of the Cognitive Science Society (CogSci 2002).
Garg, R. (1995).  Characterization of Video Traffic.
Garg, N. P., Favre B., Riedhammer K., & Hakkani-Tür D. (2009).  ClusterRank: A Graph Based Method for Meeting Summarization. 1499-1502.
Gathen, J. von zur, Karpinski M., & Shparlinski I. (1994).  Counting Curves and Their Projections.
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).
Ghodsi, A., Zaharia M., Shenker S. J., & Stoica I. (2013).  Choosy: Max-Min Fair Sharing for Datacenter Jobs with Constraints. 365-378.
Gildea, D. (2001).  Corpus Variation and Parser Performance. Proceedings of the 2001 Conference on Empirical Methods in Natural Language Processing (EMNLP 2001).
Gillick, D. (2010).  Can Conversational Word Usage Be Used to Predict Speaker Demographics?.
Goldreich, O., Ostrovsky R., & Petrank E. (1994).  Computational Complexity and Knowledge Complexity.
Gottlieb, L., Friedland G., Choi J., Kelm P., & Sikora T. (2014).  Creating Experts From the Crowd: Techniques for Finding Workers for Difficult Tasks. IEEE Transactions on Multimedia. 16(7), 2075-2079.
Govil, K., Chan E., & Wasserman H. (1995).  Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU.
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.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.
Guesgen, H. Werner (1990).  A Connectionist Approach to Symbolic Constraint Satisfaction.
Günes, M., & Siekermann J. (2005).  CosMos - Communication Scenario and Mobility Scenario Generator.
Günther, O. (1988).  The Cell Tree: An Index for Geometric Databases.
Gupta, A., & Moran M. (1993).  Channel Groups: A Unifying Abstraction for Specifying Inter-stream Relationships.
Gusella, R. (1990).  Characterizing the Variability of Arrival Processes with Indices of Dispersion.

Pages