archive-edu.com » EDU » C » COLUMBIA.EDU

Total: 442

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • Sean White
    Your browser does not handle frames

    Original URL path: http://www.cs.columbia.edu/~swhite/ (2016-02-17)
    Open archived version from archive


  • Eugene Agichtein is now an Assistant Professor at Emory U.
    now an Assistant Professor in the Mathematics and Computer Science department at Emory University You will be automatically redirected to my new homepage or proceed to http www mathcs emory

    Original URL path: http://www.cs.columbia.edu/~eugene/ (2016-02-17)
    Open archived version from archive

  • Andrew Miller
    Columbia my research interests included physical simulation robotic grasping and visual servoing As part of my dissertation I developed GraspIt a simulation system for robotic grasping I have since left the world of robotics behind and I am now a

    Original URL path: http://www.cs.columbia.edu/~amiller/ (2016-02-17)
    Open archived version from archive

  • Cheoljoo Jeong
    Circuits and Systems Group and my advisor is Professor Steven Nowick Before I came here I was a senior member of research staff at ETRI a national lab in Korea Research interests Publications Software Resume Links Department of Computer Science

    Original URL path: http://www.cs.columbia.edu/~cjeong/ (2016-02-17)
    Open archived version from archive

  • Peggy B. McGee
    ICCAD 07 pages 180 187 Abstract BibTex Full Text pdf The time separation of events TSE problem is that of finding the maximum and minimum separation between the times of occurrence of two events in a concurrent system It has applications in the performance analysis optimization and verification of concurrent digital systems This paper introduces an efficient polynomial time algorithm to give exact bounds on TSE s for choice free concurrent systems whose operational semantics obey the max causality rule A choice free concurrent system is modeled as a strongly connected marked graph where delays on operations are modeled as bounded intervals with unspecified distributions While previous approaches handle acyclic systems only or else require graph unfolding until a steady state behavior is reached the proposed approach directly identifies and evaluates the asymptotic steady state behavior of a cyclic system via a graph theoretical approach As a result the method has significantly lower computational complexity than previously proposed solutions A prototype CAD tool has been developed to demonstrate the feasibility and efficacy of our method A set of experiments have been performed on the tool as well as two existing tools with noticeable improvement on runtime and accuracy for several examples hide abstract Efficient Performance Analysis of Asynchronous Systems Based on Periodicity Peggy B McGee Steven M Nowick and E G Coffman Jr in Proceeding of the Third IEEE ACM IFIP International Conference on Hardware Software Codesign and System Synthesis CODES ISSS 05 pages 225 230 Abstract BibTex Full Text pdf This paper presents an efficient method for the performance analysis and optimization of asynchronous systems An asynchronous system is modeled as a marked graph with probabilistic delay distributions We show that these systems exhibit inherent periodic behaviors Based on this property we derive an algorithm to construct the state space of the system through composition and capture the time evolution of the states into a periodic Markov chain The system is solved for important performance metrics such as the distribution of input arrival time at a component which is useful for subsequent system optimization as well as relative component utilization system latency and throughput We also present a tool to demonstrate the feasibility of this method Initial experimental results are promising showing over three orders of magnitude improvement in runtime and nearly two orders of magnitude decrease in the size of the state space over previously published results While the focus of this paper is on asynchronous digital systems our technique can be applied to other concurrent systems that exhibit global asynchronous behavior such as GALS and embedded systems hide abstract A Lattice based Framework for the Classification and Design of Asynchronous Pipelines Peggy B McGee and Steven M Nowick in Proceeding of the 42nd Annual Conference on Design Automation DAC 05 pages 491 496 Abstract BibTex Full Text pdf This paper presents a unifying framework for the modeling of asynchronous pipeline circuits A pipeline protocol is captured in a graph based model which defines the partial ordering of

    Original URL path: http://www.cs.columbia.edu/~pmcgee/ (2016-02-17)
    Open archived version from archive

  • field is being used for creating static contents. --> Department of Computer Science, Columbia University | Topics Courses
    C x Topics in Financial Computing Video Game Development x Video Game Technology Production and Design x VoIP Security x x COMS 6998 Course Computational Biology Computer Security Foundations Machine Learning Natural Language Processing Network Systems Software Systems Vision and Graphics 3D UI Curriculum Design x Advanced Distributed Systems x x x x Advanced Image Based Vision and Rendering x Advanced Internet Routing x Adv Sem Computational Genomics x Adv Topics in Comp Geometry x Adv Topics in Complexity Theory x Adv Topics in Machine Learning x x x x Advanced Topics in Programming Language Compilers x x Advanced Topics in Security x Advanced Video Game Development x Algo Techniques Massive Data x x x x Algorithms for Dealing with Massive Data x x Algorithmic Game Theory x x Algorithmic Graph Theory x x Bayesian Analysis for NLP x x Biological Networks x Cellular Networks Mobile Compt x Cloud Computing x x x Cloud Computing and Big Data x x x x x Cloud and Mobile Challenges x x Cloud and Mobile Security x Comp Methods High Thrghpt SEQ x Comp Models of Social Meaning x x x Computational Aspects of Geometrical Design x Computational Human Genetics x Cpm Vis Machine Learning Mobile Platform x x x Content Distribution x Content Networking x Data Science Entrepreneurship x x Digitally Mediated Storytelling x x Econ of Social Networks x x x Embedded Scalable Platforms x Experimental Analysis Algos x x Formal Hardware Software Verification x Formal Verification x Formal Verification HW SW Syst x x Fund of Speaker Recognition Fund of Speech Recognition x x Geometry Processing and Animation x Graphics Comp Motion x High Dimensional Data Analysis x x Humanoid Robotics x Internet Economics x Intro Distributed Data Mining x x Lower Bounds of Theoretical CS x Machine Learning for

    Original URL path: http://www.cs.columbia.edu/education/ms/topics-courses (2016-02-17)
    Open archived version from archive

  • From Data to Solutions IGERT - HowToApply
    S citizen or U S permanent resident who is applying to a doctorally tracked program in one of the participating departments or programs at Columbia University or CUNY Application Instruction For Columbia CS and EE applications the on line admissions applications includes a special box to check to indicate your interest in this IGERT program Each applicant must also fill out an IGERT Application form For Columbia CS and EE

    Original URL path: http://www.cs.columbia.edu/igert/howtoapply.shtml (2016-02-17)
    Open archived version from archive

  • field is being used for creating static contents. --> Department of Computer Science, Columbia University | Outside Activities
    on Outside Activities Students who are funded through a graduate research assistantship GRA must discuss with their advisor any research activities outside the lab as well as any consulting activities GRAs should also discuss with their advisor any additional classes they intend to take or any extra teaching TAing beyond those needed to fulfill the doctoral program requirements In addition to slowing degree progress such outside activities may imperil progress

    Original URL path: http://www.cs.columbia.edu/education/phd/requirements/outside (2016-02-17)
    Open archived version from archive