Browse by Subject "computer science"

  • Xin, Dong; Shao, Zheng; Han, Jiawei; Liu, Hongyan (2005-10)
    It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2)closed cube, where a group of cells which ...
    untranslated PDF (209KB)
  • Strauss, Karin (2007-08)
    Design complexity and limited power budget are causing the number of cores on the same chip to grow very rapidly. The wide availability of Chip Multiprocessors (CMPs) is enabling the design of inexpensive, shared-memory ...
    untranslated PDF (620KB)
  • Farzan, Azadeh; Madhusudan, P. (2007-01)
    We define a novel formulation of dataflow analysis for concurrent programs, where the flow of facts is along the causal dependencies of events. We capture the control flow of concurrent programs using a Petri net (called ...
    untranslated PDF (2MB)
  • Lucanu, Dorel; Rosu, Grigore (2009-02)
    Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a "good" relation extending one's goal with additional lemmas, making automation of coinduction a challenging ...
    untranslated PDF (260KB)
  • Rosu, Grigore; Lucanu, Dorel (2009-02)
    Several algorithmic variants of circular coinduction have been proposed and implemented during the last decade, but a proof theoretical foundation of circular coinduction in its full generality is still missing. This paper ...
    untranslated PDF (223KB)
  • Wolf, Michael M.; Heath, Michael T. (2009-02)
    It has been shown that combinatorial optimization of matrix-vector multiplication can lead to faster evaluation of finite element stiffness matrices. Based on a graph model characterizing relationships between rows, an ...
    untranslated PDF (310KB)
  • Hendrix, Joe; Ohsaki, Hitoshi (2008-02)
    In this paper, we study combining equational tree automata in two different senses: (1) whether decidability results about equational tree automata over disjoint theories imply similar decidability results in the combined ...
    untranslated PDF (463KB)
  • Epshteyn, Arkady (2007-04)
    For many tasks such as text categorization and control of robotic systems, state-of-the art learning systems can produce results comparable in accuracy to those of human subjects. However, the amount of training data needed ...
    untranslated PDF (1MB)
  • Ren, Gang (2006-07)
    As an effective way of utilizing data parallelism in applications, SIMD architecture has been adopted by most today's microprocessors. Using intrinsic functions and automatic compilation are common programming methods for ...
    untranslated PDF (645KB)
  • Hu, Chunyu; Hou, Jennifer C. (2006-04)
    This technical report presents a comprehensive study of the Enhanced Distributed Control Access (EDCA) function defined in IEEE 802.11e. All the three factors are considered. They are: contention window size (CW), arbitration ...
    untranslated PDF (500KB)
  • Serbanuta, Traian Florin; Rosu, Grigore (2006-02)
    An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying ...
    untranslated PDF (330KB)
  • Sen, Koushik; Agha, Gul A. (2006-01)
    Testing concurrent programs that accept data inputs is notoriously hard because, beside the large number of possible data inputs, nondeterminism results in an exponentially large number of interleavings of concurrent events. ...
    untranslated PDF (277KB)
  • Tran, Duan; Forsyth, D. A. (2007-04)
    Fair discriminative pedestrian finders are now available. However, these pedestrian finders make most errors on pedestrians in configurations that are uncommon in the training data, for example, mounting a bicycle. This ...
    untranslated PDF (2MB)
  • Kumar, Viraj (2007-09)
    The ever-increasing reliance on digital systems has dramatically increased the emphasis on the reliability of the software controlling them. Consequently, techniques known as formal methods have been developed to mathematically ...
    untranslated PDF (867KB)
  • Alur, Rajeev; Kumar, Viraj; Madhusudan, P.; Viswanathan, Mahesh (2005-04)
    We study congruences on words in order to characterize the class of visibly pushdown languages (VPL), a subclass of context-free languages. For any language L, we define a natural congruence on words that resembles the ...
    untranslated PDF (263KB)
  • Kim, Hong-Seok (2004-12)
    This dissertation addresses the scalability problem of context-sensitive pointer analysis based on Andersen's inclusion-based approach. The key observation is that procedures without any observable effects on callers, ...
    untranslated PDF (587KB)
  • Cheng, Tao; Chang, Kevin C-C. (2007-10)
    As the Web has evolved into an entity abundant repository, with the standard ``page view'', current search engines are becoming increasingly inadequate for a wide range of query tasks. Entity search, a significant departure ...
    untranslated PDF (309KB)
  • Hailpern, Joshua; Karahalios, Karrie; Halle, Jim; DeThorne, Laura; Coletto, Mary-Kelsey (2008-11)
    One hallmark difficulty of children with Autism Spectrum Disorder (ASD) centers on communication and speech. Research into computer visualizations of voice has been shown to influence conversational patterns and allow users ...
    untranslated PDF (4MB)
  • Harris III, Albert F. (2006-03)
    Advances in computing technology have resulted in high-end mobile devices with extensive computational capabilities that enable complex applications such as video encoding or lossless data compression. However, the energy ...
    untranslated PDF (667KB)
  • Chang, Po-Hao (2007-08)
    Although platforms and execution scenarios are constantly evolving, Web applications today are tightly coupled with the specific platforms and execution scenarios that are envisioned at design time. Consequently, these Web ...
    untranslated PDF (2MB)