Now showing items 448-467 of 488

    • TABLA: A Unified Template-based Framework for Accelerating Statistical Machine Learning 

      Mahajan, Divya; Park, Jongse; Amaro, Emmanuel; Sharma, Hardik; Yazdanbakhsh, Amir; Kim, Joon; Esmaeilzadeh, Hadi (Georgia Institute of Technology, 2015)
      A growing number of commercial and enterprise systems increasingly rely on compute-intensive machine learning algorithms. While the demand for these compute-intensive applications is growing, the performance benefits from ...
    • Target Container: A Target-Centric Parallel Programming Abstraction for Video-based Surveillance 

      Hong, Kirak; Ramachandran, Umakishore; Shin, Junsuk; Branzoi, Bogdan; Iftode, Liviu; Smaldone, Stephen (Georgia Institute of Technology, 2010)
      Surveillance systems are some of the most computationally intensive applications. Despite technological advances, lowcost of sensors, and continuous improvement of computer vision algorithms for analyzing video data, ...
    • A Technique for Dynamic Updating of Java Software 

      Orso, Alessandro; Rao, Anup; Harrold, Mary Jean (Georgia Institute of Technology, 2002)
      TDuring maintenance, systems are updated to correct faults, improve functionality, and adapt the software to changes in its execution environment. The typical software-update process consists of stopping the system ...
    • Testing Simultaneous Similarity of Matrices and Related Problems for Matrix Semigroups 

      Ogihara, Mitsunori; Zalcstein, Yechezkel (Zeke) (Georgia Institute of Technology, 2002)
      This paper studies the problem of testing simultaneous similarity of matrics and related problems about matrix semigroups. Along with SIMULTANEOUS SIMILARITY this paper studies two problems: NONSINGULAR NULLSPACE ...
    • A Theory of Interaction and Independence in Sentence Understanding 

      Mahesh, Kavi (Georgia Institute of Technology, 1993)
      Developing a complete and well-specified computational model of human language processing is a difficult problem. Natural language understanding requires the application of many different kinds of ...
    • A Theory of Reflective Agent Evolution 

      Murdock, J. William (Georgia Institute of Technology, 1998)
      Intelligent agents typically operate in complex, dynamic environments. Such environments require that an agent be able to adapt to meet new demands. One promising strategy for such adaptation is to have an agent reason ...
    • Time Series Models for Internet Traffic 

      Basu, Sabyasachi; Mukherjee, Amarnath; Klivansky, Steven M. (Georgia Institute of Technology, 1995)
      Data traffic sequences from two campus FDDI rings, an Ethernet, two entry/exit points of the NSFNET, and sub-sequences belonging to popular TCP port numbers on one of the FDDI rings indicate that appropriately differenced ...
    • Timepatch: A Novel Technique for the Parallel Simulation of Multiprocessor Caches 

      Shah, Gautam H.; Ramachandran, Umakishore; Fujimoto, Richard M. (Georgia Institute of Technology, 1994)
      We present a new technique for the parallel simulation of cache coherent shared memory multiprocessors. Our technique is based on the fact that the functional correctness of the simulation can be decoupled from its ...
    • Timing Analysis for Preemptive Multi-tasking Real-Time Systems with Caches 

      Tan, Yudong; Mooney, Vincent John, III (Georgia Institute of Technology, 2004)
      In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of each task in a preemptive multi-tasking single-processor real-time system with an L1 cache. The approach combines inter-task cache ...
    • To Gather Together for a Better World: Understanding and Leveraging Communities in Micro-lending Recommendation 

      Choo, Jaegul; Lee, Daniel; Dilkina, Bistra; Zha, Hongyuan; Park, Haesun (Georgia Institute of Technology, 2013)
      Micro-finance organizations provide non-profit lending opportunities to mitigate poverty by financially supporting impoverished, yet skilled entrepreneurs who are in desperate need of an institution that lends to them. ...
    • Toward A Method of Grouping Server Data Fragments for Improving Scalability in Intermittently Synchronized Databases 

      Yee, Wai Gen; Donahoo, Michael J.; Navathe, Shamkant B. (Georgia Institute of Technology, 1999)
      We consider the class of mobile computing applications with periodically connected clients. These clients wish to share data; however, due to the expense of mobile communication, they only connect periodically -- and ...
    • Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons 

      Kim, Jingu; Park, Haesun (Georgia Institute of Technology, 2008)
      Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer class discovery. The mathematical formulation ...
    • Towards a Framework for Hypermedia Scenarios 

      Hobbs, Reginald L. (Reginald Lionel); Potts, Colin (Georgia Institute of Technology, 1998)
      Scenarios have been used in many disciplines, such as software engineering, cognitive science, and HCI (Human-Computer Interaction) to aid in decision making, comprehension, design, and training. Scenarios are instances ...
    • Towards an Internet Connectivity Market 

      Feamster, Nick; Hassan, Umayr; Sundaresan, Srikanth; Valancius, Vytautas; Johari, Ramesh; Vazirani, Vijay (Georgia Institute of Technology, 2009)
      Today’s Internet achieves end-to-end connectivity through bilateral contracts between neighboring networks; unfortunately, this “one size fits all” connectivity results in less efficient paths, unsold capacity and unmet ...
    • Towards aspect-oriented programming support for cluster computing 

      Wolenetz, Matthew David; Mandviwala, Hasnain A.; Adhikari, Sameer; Angelov, Yavor; Ramachandran, Umakishore; Mackenzie, Kenneth M.; Rehg, James Matthew (Georgia Institute of Technology, 2002)
      Interactive multimedia applications (such as audio/video processing) are good candidates for cluster computing. Such applications are best represented as coarse-grain dataflow graphs and are rich in pipelined, task, and ...
    • Towards Finding Optimal Partitions of Categorical Datasets 

      Chen, Keke; Liu, Ling (Georgia Institute of Technology, 2003)
      A considerable amount of work has been dedicated to clustering numerical data sets, but only a handful of categorical clustering algorithms are reported to date. Furthermore, almost none has addressed the following two ...
    • Towards Transactional Data Management over the Cloud 

      Tiwari, Rohan G.; Navathe, Shamkant B.; Kulkarni, Gaurav J. (Georgia Institute of Technology, 2010)
      We propose a consistency model for a data store in the Cloud and work towards the goal of deploying Database as a Service over the Cloud. This includes consistency across the data partitions and consistency of any replicas ...
    • TowerDefense: Deployment Strategies for Battling against IP Prefix Hijacking 

      Qiu, Tongqing; Ji, Lusheng; Pei, Dan; Wang, Jia; Xu, Jun (Georgia Institute of Technology, 2010)
      IP prefix hijacking is known as one of the top security threats targeting today's Internet routing infrastructure. Several schemes have been proposed to either detect or mitigate prefix hijacking events. However, none ...
    • Trading Latency for Energy in Wireless Ad Hoc Networks using Message Ferrying 

      Jun, Hyewon; Zhao, Wenrui; Ammar, Mostafa H. (Mostafa Hamed); Zegura, Ellen W.; Lee, Chungki (Georgia Institute of Technology, 2004)
      Power management is a critical issue in wireless ad hoc networks where the energy supply is limited. In this paper, we investigate a routing paradigm, Message Ferrying (MF), to save energy while trading off data delivery ...
    • The Truth, the Whole Truth, and Nothing but the Truth: Alphabet Independent Two Dimensional Witness Table Construction 

      Amir, Amihood; Benson, Gary; Farach-Colton, Martin (Georgia Institute of Technology, 1993)
      The current explosion of stored information necessitates a new model of pattern matching, that of compressed matching. In this model one tries to find all occurrences of a pattern in a compressed text in time proportional ...