• 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 55

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

    Variations of Submodularity and Diversity: from Robust Optimization to Markov Chains 

    Jegelka, Stefanie (2017-09-25)
    The combinatorial concept of submodular set functions has proved to be a very useful discrete structure for optimization in machine learning and its applications. In this talk, I will show recent work on generalizations ...
    Thumbnail

    Expectation-Oriented Framework for Automating Approximate Programming 

    Esmaeilzadeh, Hadi; Ni, Kangqi; Naik, Mayur (Georgia Institute of Technology, 2013)
    This paper describes ExpAX, a framework for automating approximate programming based on programmer-specified error expectations. Three components constitute ExpAX: (1) a programming model based on a new kind of program ...
    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

    Power Optimization of Embedded Memory Systems via Data Remapping 

    Palem, Krishna V.; Rabbah, Rodric Michel; Mooney, Vincent; Korkmaz, Pinar; Puttaswamy, Kiran (Georgia Institute of Technology, 2002)
    In this paper, we provide a novel compile-time data remapping algorithm that runs in linear time. This remapping algorithm is the first fully automatic approach applicable to pointer-intensive dynamic applications. We ...
    Thumbnail

    Online algorithms and the k-server conjecture 

    Madry, Aleksander (Georgia Institute of Technology, 2011-11-11)
    Traditionally, in the problems considered in optimization, one needs to produce the solution only after the whole input is made available. However, in many real-world scenarios the input is revealed gradually, and one needs ...
    Thumbnail

    Stochastic Gradient Descent with Only One Projection 

    Jin, Rong (Georgia Institute of Technology, 2012-09-28)
    Although many variants of stochastic gradient descent have been proposed for large-scale convex optimization, most of them require projecting the solution at {\it each} iteration to ensure that the obtained solution stays ...
    Thumbnail

    Learning Submodular Functions 

    Balcan, Maria-Florina; Harvey, Nicholas J. A. (Georgia Institute of Technology, 2009)
    This paper considers the problem of learning submodular functions. A problem instance consists of a distribution on {0,1}[superscript n] and a real-valued function on {0,1}[superscript n] that is non-negative, monotone ...
    Thumbnail

    Incremental Light Bundle Adjustment for Robotics Navigation 

    Indelman, Vadim; Melim, Andrew; Dellaert, Frank (Georgia Institute of Technology, 2013-11)
    This paper presents a new computationally-efficient method for vision-aided navigation (VAN) in autonomous robotic applications. While many VAN approaches are capable of processing incoming visual observations, incorporating ...
    Thumbnail

    Efficient and principled robot learning: Theory and algorithms 

    Cheng, Ching An (Georgia Institute of Technology, 2020-01-07)
    Roboticists have long envisioned fully-automated robots that can operate reliably in unstructured environments. This is an exciting but extremely difficult problem; in order to succeed, robots must reason about sequential ...
    Thumbnail

    What 2-layer neural nets can we optimize? 

    Ge, Rong (2019-10-28)
    Optimizing neural networks is a highly nonconvex problem, and even optimizing a 2-layer neural network can be challenging. In the recent years many different approaches were proposed to learn 2-layer neural networks under ...
    • 1
    • 2
    • 3
    • 4
    • . . .
    • 6

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CommunityDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Discover

    AuthorDellaert, Frank (7)Ammar, Mostafa H. (3)Bazzi, Rida Adnan (2)Fei, Zongming (2)Indelman, Vadim (2)Neiger, Gil (2)Ni, Kai (2)Steedly, Drew (2)Zegura, Ellen (2)Agarwalla, Bikash (1)... View MoreSubject
    Optimization (55)
    Algorithms (7)Machine learning (6)Robotics (3)Simultaneous localization and mapping (3)Structure from motion (3)Abstractions (2)Base nodes (2)Bundle adjustment (2)Data streams (2)... View MoreDate Issued2020 - 2021 (4)2010 - 2019 (23)2000 - 2009 (17)1993 - 1999 (7)Has File(s)Yes (55)
    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