Publications

Found 4228 results
[ Author(Asc)] Title 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 
G
Guesgen, H. Werner (1989).  A Tagging Method for Distributed Constraint Satisfaction.
Gude, N. S., Koponen T., Pettit J., Pfaff B., Casado M., McKeown N., et al. (2008).  NOX: Towards an Operating System for Networks. ACM SIGCOMM Computer Communication Review. 38(3), 105-110.
Guadarrama, S., Rodner E., Saenko K., & Darrell T. (2015).  Understanding object descriptions in robotics by open-vocabulary object retrieval and detection. The International Journal of Robotics Research. 35(1-3), 265-280.
Guadarrama, S., Rodner E., Saenko K., Zhang N., Farrell R., Donahue J., et al. (2014).  Open-Vocabulary Object Retrieval.
Guadarrama, S., Krishnamoorthy N., Malkarnenkar G., Mooney R., Darrell T., & Saenko K. (2013).  YouTube2Text: Recognizing and Describing Arbitrary Activities Using Semantic Hierarchies and Zero-Shoot Recognition.
Guadarrama, S., Riano L., Golland D., Göhring D., Jia Y., Klein D., et al. (2013).  Grounding Spatial Relations for Human-Robot Interaction.
Grigoriev, D. Yu., Karpinski M., der Heide F. Meyer auf, & Smolensky R. (1995).  A Lower Bound for Randomized Algebraic Decision Trees.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1990).  Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents.
Grigoriev, D. Yu., & Karpinski M. (1993).  Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees.
Grigoriev, D. Yu., & Karpinski M. (1991).  Algorithms for Sparse Rational Interpolation.
Grigoriev, D. Yu., Karpinski M., & Yao A. C. (1995).  An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX.
Grigoriev, D. Yu., & Karpinski M. (1996).  Randomized ?(n^2) Lower Bound for Knapsack.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].
Grigoriev, D. Yu., Karpinski M., & Vorobjov N. (1993).  Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Grigoriev, D. Yu., Karpinski M., & Odlyzko A. M. (1991).  Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.
Griesemer, R. (1994).  Detection of Side-Effects in Function Procedures.
Grier, C., Thomas K., Paxson V., & Zhang M. (2010).  @spam: The Underground on 140 Characters or Less. 27-37.
Grier, C., Ballard L., Caballero J., Chachra N., Dietrich C. J., Levchenko K., et al. (2012).  Manufacturing Compromise: The Emergence of Exploit-as-a-Service. 821-832.
Greenwald, A., Friedman E., & Shenker S. J. (2001).  Learning in Network Contexts: Experimental Results from Simulations. Games and Economic Behavior. 35(1), 80-123.
Greenstein, B., Estrin D., Govindan R., Ratnasamy S., & Shenker S. J. (2003).  DIFS: A Distributed Index for Features in Sensor Networks. Proceedings of the First IEEE Workshop on Sensor Networks Protocols and Applications 2003 (SNPA). 163-173.
Greenstein, B., Estrin D., Govindan R., Ratnasamy S., & Shenker S. J. (2003).  DIFS: A Distributed Index for Features in Sensor Networks. Elsevier Journal of Ad Hoc Networks. 1,
Greenspon, M. C. (1992).  Ring Array Processor: Programmer's Guide to the RAP Libraries.
Greenberg, S. (2001).  From Here to Utility - Melding Phonetic Insight with Speech Technology. Proceedings of the 7th European Conference on Speech Communication and Technology (Eurospeech 2001).
Greenberg, S., & Arai T. (1998).  Speech Intelligibility is Highly Tolerant of Cross-Channel Spectral Asynchrony. Proceedings of the Joint Meeting of the 137th Acoustical Society of America and the 16th International Congress on Acoustics (ICA/ASA). 2677-2678.

Pages