- Incorporating Site-Level Knowledge to Extract Structured Data from Web Forums
- A Type-theoretic Interpretation of Pointcuts and Jay Ligatti
- Visual Display of Diffusion Tensor Fields Gordon Kindlmann
- ELE/COS 583: Great Moments in Computing (Spring 2009) Instructors
- Scalable Routing Overlay Networks Akihiro Nakao
- A Modular RCP for Flexible Interdomain Route Control Princeton University
- Exploring Traversal Strategy for Web Forum Crawling *, Jiang-Ming Yang
- Additional information page to be appended to travel vouchers for foreign travel charged (fully or partially) to sponsored research
- Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA
- A Fresh Look at Separation Algebras and Share Accounting
- 1 Introduction 4 2 Background 6
- Olga G. Troyanskaya, Ph.D. Associate Professor
- Approximating Betweenness Centrality David A. Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail
- Hiding Amongst the Clouds: A Proposal for Cloud-based Onion Routing Nicholas Jones, Matvey Arye, Jacopo Cesareo, and Michael J. Freedman
- Appeared in 7th USENIX Symposium on Network Design and Implementation (NSDI '10)
- SNDTOOLS: REAL-TIME AUDIO DSP AND 3D VISUALIZATION Ananya Misra Ge Wang Perry R. Cook
- SANJEEV ARORA Curriculum Vitae, November 2011.
- Commensal Cuckoo: Secure Group Partitioning for Large-Scale Services
- Making Diversity Work on Campus: A Research-Based Perspective
- Putting BGP on the Right Path: Better Performance via Next-Hop Routing
- ChucK => A Concurrent, On-the-fly Audio Programming Language
- F : A N P L C -: P J R
- Refactoring Router Software to Minimize Disruption
- NSF Cyber Trust PI Meeting January 28-30, 2007
- How to Include Zebras in the
- Efficient Private Techniques for Verifying Social Proximity Michael J. Freedman
- MyOps: A Monitoring and Management Framework for PlanetLab Deployments
- Aggregating Human Expertise: An Application for Alternating Projection Algorithms
- Aditya Bhaskara 35 Olden Street
- Exploiting the Produce-Consume Relationship in DMA to Improve I/O Performance
- Modular Protections against Non-control Data Attacks Cole Schlesinger
- Scalable Management of Enterprise and Data-Center Networks
- In Proceedings of the 2004 International Conference on New Interfaces for Musical Expression (NIME) On-the-fly Programming: Using Code as an
- Interpreting Gene Lists Using a Literature-Derived Protein-Interaction Network
- MIRO: MULTI-PATH INTERDOMAIN ROUTING A DISSERTATION
- Hiding Amongst the Clouds: A Proposal for Cloud-based Onion Routing Nicholas Jones, Matvey Arye, Jacopo Cesareo, and Michael J. Freedman
- A Logical Mix of Approximation and Separation Aquinas Hobor1
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and
- Interprocedural Exception Analysis for C++ Prakash Prabhu1,2
- Relational decomposition Lennart Beringer
- Interactive Image-Based Rendering Using Feature Globalization
- Monotonicity and Implementability Itai Ashlagi
- Improving Prediction Accuracy of Matrix Factorization Based Network Coordinate Systems
- Information Processing Letters 111 (2011) 10921095 Contents lists available at SciVerse ScienceDirect
- IP Address Passing for VANETs Todd Arnold
- VeriSmall: Verified Smallfoot Shape Analysis Andrew W. Appel
- The genetic code of gene regulatory elements Ivan Ovcharenko
- Scalable Causal Consistency for Wide-Area Storage with COPS Wya$ Lloyd (Princeton), Michael J. Freedman (Princeton), Michael Kaminsky (Intel Labs), David G. Andersen (CMU)
- Deletion Without Rebalancing in Balanced Binary Trees Siddhartha Sen
- Bytecode Verification for Haskell Robert Dockins and Samuel Z. Guyer
- Automatic Generation of Data-Processing Tools Yitzhak Mandelbaum and David Walker
- A 4-part series appearing on freedom-to-tinker.com, with a 1-part sequel
- Yungang Bao Associate Professor Visiting Postdoctoral Fellow
- ChucK: A Programming Language for On-the-fly, Real-time Audio Synthesis and Multimedia
- Neighbor Selection Based on TIV Severity Sort Model in Vivaldi Network Coordinate System
- A Maximum Entropy Approach to Species Distribution Modeling Miroslav Dudik
- Securing BGP Incrementally Martin Suchara
- "Scalability and Relevance in an Internet-scale Persistent Search System"
- A revised version of this paper was published in Proc. 2007 USENIX/ACCURATE Electronic Voting Technology Workshop (EVT'07), August 2007. For the workshop paper and videos of demonstration attacks, see http://citp.princeton.edu/voting.
- Computational Approaches Towards Human Genome Annotation
- Fiducial Planning for Error-Bounded Pose Estimation of a Panoramic Camera in Large Environments
- VIRTUAL HOUSING TOUR Prepared in March 2010 by Ana Pop
- In Proceedings of the 2004 International Computer Music Conference The Audicle: A Context-Sensitive, On-the-fly
- Reliable Internet Routing Martin Suchara
- Jacopo Cesareo 2 Faculty Rd, 5V Magie Apts.
- Relational program logics in decomposed style Lennart Beringer
- Privacy-Preserving Collaborative Anomaly Detection
- Reducibility Among Fractional Stability Problems Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, and Shang-Hua Teng
- Well-typed Trustworthy Computing in the Presence of Transient Faults In recent decades, microprocessor performance has been increasing exponentially, due in large part to smaller and
- Extracting roads from dense point clouds in large scale urban environment
- SSDAlloc: Hybrid SSD/RAM Memory Management Made Easy Anirudh Badam and Vivek S. Pai
- Analysis of Relative Feedback in a Video Game Dominic Kao
- MINIMIZING WIDE-AREA PERFORMANCE DISRUPTIONS IN INTER-DOMAIN ROUTING
- Bytecode Verification for Haskell Robert Dockins
- How to Compress Interactive Communication Mark Braverman
- Protein Helical Topology Prediction Using Mixed-Integer Linear Programming
- Appeared in 9th USENIX Symposium on Operating Systems Systems Design and Implementation (OSDI '10)
- The CHART System: A High-Performance, Fair Transport Architecture Based on Explicit-Rate Signaling
- A PRINCIPLED APPROACH TO MANAGING ROUTING IN LARGE ISP NETWORKS
- A Routing Underlay for Overlay Networks Akihiro Nakao, Larry Peterson and Andy Bavier
- Skip Links Sign into My WilsonWeb Customize Display Help Technical Support RECORD VIEW
- SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees
- In Proc. USENIX Annual Technical Conference. San Diego, CA, June 2009.
- AVC Advantage: Hardware Functional Specifications
- Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
- SDP Gaps and UGC Hardness for Multiway Cut, 0Extension and Metric Labelling
- O# ### O######### ## # C#### ## LP##### A######### # Amit Kumar + Rajsekar Manokaran # Madhur Tulsiani Nisheeth K. Vishnoi
- Creating New CPU Schedulers with Virtual Time Andy Bavier
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and
- SCHEDULE CI (Form 1040)
- Every Permutation CSP of arity 3 is Approximation Resistant Moses Charikar #
- Reducibility Among Fractional Stability Problems Shiva Kintali # Laura J. Poplawski +# Rajmohan Rajaraman ##
- Mbius Transformations For Global Intrinsic Symmetry Analysis
- Reducibility Among Fractional Stability Problems Shiva Kintali
- Local Actions for a Curry-style Operational Semantics Gordon Stewart Andrew W. Appel
- Safe Programmable Speculative Parallelism Prakash Prabhu
- arXiv:0809.1906v2[cs.DS]19Oct2008 Betweenness Centrality : Algorithms and Lower Bounds
- Computational methods for optimizing interparticle interactions using inverse methods
- In Proceedings of the 2003 International Computer Music Conference. ChucK: A Concurrent, On-the-fly, Audio Programming Language
- Rethinking Traffic Management: Design of Optimizable Networks
- SDP Gaps and UGC Hardness for Multiway Cut, 0-Extension and Metric Labelling
- In VINI Veritas: Realistic and Controlled Network Experimentation
- A Fine-grained Component-level Power Measurement Method Zehan Cui1,2
- Sample Programming Exam Author: Jude Nelson (jcnelson@cs.princeton.edu)
- A Dependent LP-rounding Approach for the k-Median Problem Moses Charikar
- Dimension Reduction of Network Bottleneck Bandwidth Data Space
- Energy-Efficient Computing for Wildlife Tracking
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Towards Securing Interdomain Routing on the Internet Sharon Goldberg
- COMBINING ANALYSIS AND SYNTHESIS IN THE CHUCK PROGRAMMING LANGUAGE
- OPENFLOW-BASED LOAD BALANCING GONE WILD RICHARD WANG
- Prophecy: Using History for High-Throughput Fault Tolerance
- Genome-wide Analysis of Polymorphic Differences That Affect Gene Expression
- PlanetFlow: Maintaining Accountability for Network Princeton University
- Prediction of protein function via graph-theoretic analysis of interaction maps
- A Distributed Protocol for Fractional Stable Paths Problem Shiva Kintali
- Princeton University Computer Science Department
- Trellis: A Platform for Building Flexible, Fast Virtual Networks on Commodity Hardware
- Reflections on Spent Time Keynote address
- Container-based Operating System Virtualization: A Scalable, High-performance Alternative to Hypervisors
- Blended Intrinsic Maps Vladimir G. Kim
- Dimension Reduction of Network Bottleneck Bandwidth Data Space
- Consistent Updates for Software-Defined Networks: Change You Can Believe In!
- HMTT: A Platform Independent Full-System Memory Trace Monitoring System
- iRobot: An Intelligent Crawler for Web Forums Rui Cai, Jiang-Ming Yang, Wei Lai, Yida Wang, and Lei Zhang
- Scalable and Efficient Self-configuring Networks
- SCALABLE AND EFFICIENT SELF-CONFIGURING NETWORKS
- Rank-Pairing Heaps Bernhard Haeupler1
- Wya$ Lloyd, Michael J. Freedman Princeton University
- Curriculum Vitae Contact Information
- Identifying Software Usage at HPC Centers with the Automatic Library Tracking Database
- Improving VPN Performance over Multiple Access Links
- The Tyche CPU Scheduler Andrew C. Bavier
- Experiences Building PlanetLab Larry Peterson, Andy Bavier, Marc E. Fiuczynski, Steve Muir
- On the Design and Evolution of an Architecture for Federation
- A 1.488-approximation algorithm for the uncapacitated facility location problem
- An Overlay Data Plane for PlanetLab Andy Bavier, Mark Huang, and Larry Peterson
- Predicting Software Change Coupling Submitted to the Faculty
- ON THE OPTIMALITY OF A CLASS OF LP-BASED ALGORITHMS Rajsekar Manokaran
- Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
- Using PlanetLab for Network Research: Myths, Realities, and Best Practices
- Using PlanetLab for Network Research: Myths, Realities, and Best Practices
- Deletion Without Rebalancing in Multiway Search Trees Siddhartha Sen1,3
- Published in DSN-DCCS 2011 Coercing Clients into Facilitating Failover for Object Delivery
- Faster Algorithms for Incremental Topological Bernhard Haeupler1
- Approximating Matrix p-norms Aditya Bhaskara
- Princeton Institute for Computational Science (PICSciE) Colloquium: Materials Properties from ab-initio Simulations
- An Algorithm for Calculating the Free-Energy of Nearly Jammed Hard-Particle Packings
- Comparing Semantic and Syntactic Methods in Mechanized Proof Frameworks
- Reasoning about Control Flow in the Presence of Transient Faults
- A Machine Learning Approach to DNA Microarray Bioinformatics Princeton University
- Extending Amdahl's Law in the Multicore Era Erlin Yao, Yungang Bao, Guangming Tan and Mingyu Chen
- Rank-Balanced Trees Bernhard Haeupler2
- Brief Announcement: Bridging the Theory-Practice Gap in Multi-Commodity Flow Routing
- DMA Cache: Using On-Chip Storage to Architecturally Separate I/O Data from CPU Data for Improving I/O Performance
- Efficient Private Matching and Set Intersection Michael J. Freedman1
- Curriculum Vitae Contact Information
- Gordon Stewart Princeton University
- Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
- P R I N C E T O N U N I V E R S I T Y Department of Computer Science, 35 Olden Street, Princeton, NJ 08540
- Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant
- P R I N C E T O N U N I V E R S I T Y Department of Computer Science, 35 Olden Street, Princeton, NJ 08540
- 353 Serra Mall Rm 242, Stanford, CA 94305 jiadeng@cs.princeton.edu
- Rehoming Edge Links for Better Traffic Engineering Eric Keller
- Chinese Journal of Electronics Vol.20, No.3, July 2011
- ICC'11 AHSM#1569355169 1 Abstract--We present a link capacity estimation model and a
- arXiv:1101.1710v2[cs.CC]5Dec2011 On Quadratic Programming with a Ratio Objective
- Automatic Speculative DOALL for Clusters Hanjun Kim Nick P. Johnson Jae W. Lee
- Eigenvectors of Random Graphs : Delocalization and Nodal Domains
- The Peter J. Eckel Newsboy Collection
- Hidden Markov Model with Parameter-Optimized K-Means Clustering for Handwriting Recognition
- arXiv:1001.2613v2[cs.DS]2May2010 Approximating Matrix p-norms
- Inapproximabilty of Densest -Subgraph from Average Case Hardness
- SUSHANT SACHDEVA 2 Faculty Road
- Statement of Research Directions Anirudh Badam
- Polynomial integrality gaps for strong SDP relaxations of Densest Aditya Bhaskara
- A note on the Lovasz theta number of random graphs Sanjeev Arora Aditya Bhaskara
- Detecting High Log-Densities an O(n1/4 ) Approximation for
- Local Actions for a Curry-style Operational Semantics Gordon Stewart Andrew W. Appel
- PRINCETON UNIVERSITY LIBRARY CHRONICLE
- Commensal Cuckoo: Secure Group Partitioning for Large-Scale Services
- Constitution of the International Relations Council Adopted 2011
- Quantitative Analysis of the VANET Connectivity: Theory and Application
- Financing Options for Students and Parents 2012-13
- A Study of the VANET Connectivity by Percolation Theory
