Found 245 results
[ Author(Asc)] Title 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 
Günther, O., & Müller R. (1998).  From GISystems to GIServices: Spatial Computing on the Internet Marketplace.
Günther, O., Krasnova H., Riehle D.., & Schöndienst V.. (2009).  Modeling Microblogging Adoption in the Enterprise.
Günes, M., & Siekermann J. (2005).  CosMos - Communication Scenario and Mobility Scenario Generator.
Gummadi, R., Kothari N., Kim Y-J., Govindan R., Karp B., & Shenker S. (2004).  Reduced State Routing in the Internet. Proceedings of the Third ACM Workshop on Hot Topics in Networks (HotNets-III).
Gummadi, K., Gummadi R., Gribble S., Ratnasamy S., Shenker S., & Stoica I. (2003).  The Impact of DHT Routing Geometry on Resilience and Proximity. Proceedings of ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM). 381-394.
Guibas, L. J., & Pellegrini M. (1992).  New Algorithmic Results for Lines-in-3-Space Problems.
Guesgen, H. Werner (1994).  On the Relationship Between Synthesizing and Tagging.
Guesgen, H. Werner (1990).  A Connectionist Approach to Symbolic Constraint Satisfaction.
Guesgen, H. Werner, & Hertzberg J. (1990).  Dynamic Constraints.
Guesgen, H. Werner (1989).  Spatial Reasoning Based on Allen's Temporal Logic.
Guesgen, H. Werner (1994).  A Formal Framework for Weak Constraint Satisfaction Based on Fuzzy Sets.
Guesgen, H. Werner, & Ladkin P. (1990).  An Algebraic Approach to General Boolean Constraint Problems.
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., Riano L., Golland D., Göhring D., Jia Y., Klein D., et al. (2013).  Grounding Spatial Relations for Human-Robot Interaction.
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.
Grigoriev, D. Yu., & Karpinski M. (1996).  Randomized ?(n^2) Lower Bound for Knapsack.
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. (1993).  Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees.
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. (1991).  Computational Complexity of 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., & Odlyzko A. M. (1991).  Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.