• Login
    Search 
    •   SMARTech Home
    • College of Computing (CoC)
    • Search
    •   SMARTech Home
    • College of Computing (CoC)
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-10 of 145

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks 

    Xu, Jun (Georgia Institute of Technology, 2002)
    In this work, we study a fundamental tradeoff issue in designing dynamic hash table (DHT) in peer-to-peer networks: the size of the routing table v.s. the network diameter. It was observed in Ratnasamy et al. that existing ...
    Thumbnail

    Secure Outsourced Garbled Circuit Evaluation for Mobile Devices 

    Carter, Henry; Mood, Benjamin; Traynor, Patrick; Butler, Kevin (Georgia Institute of Technology, 2012)
    Garbled circuits provide a powerful tool for jointly evaluating functions while preserving the privacy of each user’s inputs. While recent research has made the use of this primitive more practical, such solutions generally ...
    Thumbnail

    Evolution in Data Streams 

    Huang, Weiyun; Omiecinski, Edward Robert; Mark, Leo (Georgia Institute of Technology, 2003)
    Conventional data mining deals with static data stored on disk, for example, using the current state of a data warehouse. In addition, the data may be read muliple times to accomplish the mining task. Recently, the data ...
    Thumbnail

    Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks 

    Ammar, Mostafa H.; Polat, Bahadir K.; Sachdeva, Pushkar; Zegura, Ellen W. (Georgia Institute of Technology, 2009)
    Message ferrying is a technique for routing data in wireless and mobile networks in which one or more mobile nodes are tasked with storing and carrying data between sources and destinations. To achieve connectivity between ...
    Thumbnail

    The Expectation Maximization Algorithm 

    Dellaert, Frank (Georgia Institute of Technology, 2002)
    This note represents my attempt at explaining the EM algorithm. This is just a slight variation on Tom Minka's tutorial, perhaps a little easier (or perhaps not). It includes a graphical example to provide some intuition.
    Thumbnail

    A Clustering Algorithm to Discover Low and High Density Hyper-Rectangles in Subspaces of Multidimensional Data. 

    Ordońẽz, Carlos; Omiecinski, Edward Robert; Navathe, Shamkant B.; Ezquerra, Norberto F. (Georgia Institute of Technology, 1999)
    This paper presents a clustering algorithm to discover low and high density regions in subspaces of multidimensional data for Data Mining applications. High density regions generally refer to typical cases, whereas low ...
    Thumbnail

    Image Mining: A New Approach for Data Mining 

    Ordońẽz, Carlos; Omiecinski, Edward Robert (Georgia Institute of Technology, 1998)
    We introduce a new focus for data mining, which is concerned with knowledge discovery in image databases. We expect all aspects of data mining to be relevant to image mining but in this first work we concentrate on the ...
    Thumbnail

    Models of computation and algorithms 

    DeMillo, Richard Alan (Georgia Institute of Technology, 1982)
    Thumbnail

    Core Selection Methods for Multicast Routing 

    Calvert, Kenneth L.; Zegura, Ellen W.; Donahoo, Michael J. (Georgia Institute of Technology, 1995)
    Multicast routing is an important topic of both theoretical and practical interest. Some recently-proposed multicast routing algorithms involve the designation of one or more network nodes as the "center" of the routing ...
    Thumbnail

    The fast multipole method at exascale 

    Chandramowlishwaran, Aparna (Georgia Institute of Technology, 2013-11-26)
    This thesis presents a top to bottom analysis on designing and implementing fast algorithms for current and future systems. We present new analysis, algorithmic techniques, and implementations of the Fast Multipole Method ...
    • 1
    • 2
    • 3
    • 4
    • . . .
    • 15

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CommunityDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Discover

    AuthorOmiecinski, Edward Robert (4)Zegura, Ellen W. (4)Harrold, Mary Jean (3)Neiger, Gil (3)Amir, Amihood (2)Calinescu, Gruia (2)Carter, Henry (2)Christensen, Henrik I. (2)Dellaert, Frank (2)Grundmann, Matthias (2)... View MoreSubject
    Algorithms (145)
    Computer algorithms (10)Optimization (8)Computer science (7)Machine learning (7)Computer graphics (6)Data mining (6)Graph algorithms (5)Combinatorial optimization (4)Computer animation (4)... View MoreDate Issued2020 - 2022 (2)2010 - 2019 (72)2000 - 2009 (37)1990 - 1999 (29)1981 - 1989 (5)Has File(s)Yes (145)
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology