Now showing items 80-99 of 297

    • Dagster: Censorship-Resistant Publishing Without Replication 

      Stubblefield, Adam; Wallach, Dan S. (2002-07-23)
      In this paper we present Dagster, a new censorship-resistant publishing scheme. Unlike previous censorship-resistant schemes, Dagster does not rely on the widespread replication of data and can even be used in a single ...
    • Data-Parallel Compiler Support for Multipartitioning 

      Chavarria, Daniel (2001-03-23)
      Strategies for partitioning an application's data determine both the range of suitable parallelizations and their potential efficiency. For multi-directional line-sweep computations, multipartitioned data distributions ...
    • Decomposition-based Motion Planning: Towards Real-time Planning forRobots with Many Degrees of Freedom 

      Brock, Oliver; Kavraki, Lydia E. (2000-08-25)
      Research in motion planning has been striving to develop faster and faster planning algorithms in order to be able to address a wider range of applications. In this paper a novel real-time motion planning framework, called ...
    • Deep imaging in scattering media with selective plane illumination microscopy 

      Pediredla, Adithya Kumar; Zhang, Shizheng; Avants, Ben; Ye, Fan; Nagayama, Shin; Chen, Ziying; Kemere, Caleb; Robinson, Jacob T.; Veeraraghavan, Ashok (2016)
      In most biological tissues, light scattering due to small differences in refractive index limits the depth of optical imaging systems. Two-photon microscopy (2PM), which significantly reduces the scattering of the excitation ...
    • Denial of Service via Algorithmic Complexity Attacks 

      Crosby, Scott A.; Wallach, Dan S. (2003-02-12)
      We present a new class of low-bandwidth denial of service attacks that exploit algorithmic deficiencies in many common applications' data structures. Frequently used data structures have "average-case'' expected running ...
    • Design and Performance of PRAN: A System for Physical Implementation ofAd Hoc Network Routing Protocols 

      Du, Shu; Johnson, David B.; PalChaudhuri, Santashil; Saha, Amit Kumar; To, Khoa (2005-02-28)
      Simulation and physical implementation are both valuable tools in evaluating ad hoc network routing protocols, but neither alone is sufficient. In this paper, we present the design and performance of PRAN, a new system for ...
    • Differentiated and Predictable Quality of Service in Web Server Systems 

      Aron, Mohit (2000-10-31)
      As the World Wide Web experiences increasing commercial and mission-critical use, server systems are expected to deliver high and predictable performance. The phenomenal improvement in microprocessor speeds, coupled with ...
    • DINC: A new AutoDock-based protocol for docking large ligands 

      Dhanik, Ankur; McMurray, John S.; Kavraki, Lydia E. (2013)
      Background: Using the popular program AutoDock, computer-aided docking of small ligands with 6 or fewer rotatable bonds, is reasonably fast and accurate. However, docking large ligands using AutoDock's recommended standard ...
    • Domain-Specific Type Inference for Library Generation in a Telescoping Compiler 

      Chauhan, Arun; Kennedy, Ken; McCosh, Cheryl (2004-04-14)
      Telescoping languages is a strategy for allowing users to develop code in high-level, domain-specific languages and still achieve high performance. It uses extensive offline processing of the library defining the language. ...
    • Drug Target Optimization in Chronic Myeloid Leukemia Using Innovative Computational Platform 

      Chuang, Ryan; Hall, Benjamin A.; Benque, David; Cook, Byron; Ishtiaq, Samin; Piterman, Nir; Taylor, Alex; Vardi, Moshe; Koschmieder, Steffen; Gottgens, Berthold; Fisher, Jasmin (2015)
      Chronic Myeloid Leukemia (CML) represents a paradigm for the wider cancer field. Despite the fact that tyrosine kinase inhibitors have established targeted molecular therapy in CML, patients often face the risk of developing ...
    • Dynamic Multiple Pattern Matching 

      Idury, Ramana (1994-05)
      Pattern matching algorithms are among the most important and practical contributions of theoretical computer science. Pattern matching is used in a wide variety of applications such as text editing, information retrieval, ...
    • E-FRP With Priorities 

      Inoue, Jun; Kaiabachev, Roumen; Taha, Walid; Zhu, Angela (2009-07-15)
      E-FRP is declarative language for programming resource-bounded, event-driven systems. Its original high-level semantics requires that each event handler execute atomically. This facilitates reasoning about E-FRP programs, ...
    • Effective Communication Coalescing for Data-Parallel Applications 

      Chavarria-Miranda, Daniel; Mellor-Crummey, John (2005-07-29)
      Communication coalescing is a static optimization that can reduce both communication frequency and redundant data transfer in compiler-generated code for regular, data parallel applications. We present an algorithm for ...
    • Effective Performance Measurement and Analysis of Multithreaded Applications 

      Mellor-Crummey, John; Tallent, Nathan (2008-10-13)
      Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore processors is a problem of growing practical ...
    • Effective Static Debugging via Componential Set-Based Analysis 

      Flanagan, Cormac (1997-08-28)
      Sophisticated software systems are inherently complex. Understanding, debugging and maintaining such systems requires inferring high-level characteristics of the system's behavior from a myriad of low-level details. For ...
    • Efficient Distributed Shared Memory Based on Multi-Protocol Release Consistency 

      Carter, John B. (1994-01)
      A distributed shared memory (DSM) system allows shared memory parallel programs to be executed on distributed memory multiprocessors. The challenge in building a DSM system is to achieve good performance over a wide range ...
    • Efficient Reorganization of Binary Search Trees 

      Hofri, Micha; Shachnai, Hadas (1996-11-13)
      We consider the problem of maintaining a binary search tree that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in which the accesses are generated according to a ...
    • Efficient Selection of Vector Instructions using Dynamic Programming 

      Barik, Rajkishore; Sarkar, Vivek; Zhao, Jisheng (2010-06-17)
      Accelerating program performance via SIMD vector units is very common in modern processors, as evidenced by the use of SSE, MMX, VSE, and VSX SIMD instructions in multimedia, scientific, and embedded applications. To take ...
    • Elastic Tasks: Unifying Task Parallelism and SPMD Parallelism with an Adaptive Runtime 

      Agrawal, Kunal; Sarkar, Vivek; Sbîrlea, Alina (2015-02-11)
      In this paper, we introduce elastic tasks, a new high-level parallel programming primitive that can be used to unify task parallelism and SPMD parallelism in a common adaptive scheduling framework. Elastic tasks are ...
    • End-to-End TCP Congestion Control over ATM Networks 

      Aron, Mohit; Druschel, Peter (1997-02-12)
      It is well documented that the effective throughput of TCP can suffer on plain ATM networks. Several research efforts have aimed at developing additions to ATM networks like Early Packet Discard that avoid TCP throughput ...