# Browse by Subject "computer science"

• (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 ...

application/pdf

PDF (1MB)
• (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 ...

application/pdf

PDF (645kB)
• (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 ...

application/pdf

PDF (500kB)
• (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 ...

application/pdf

PDF (330kB)
• (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. ...

application/pdf

PDF (277kB)
• (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 ...

application/pdf

PDF (2MB)
• (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 ...

application/pdf

PDF (867kB)
• (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 ...

application/pdf

PDF (263kB)
• (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, ...

application/pdf

PDF (587kB)
• (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 ...

application/pdf

PDF (309kB)
• (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 ...

application/pdf

PDF (4MB)
• (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 ...

application/pdf

PDF (667kB)
• (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 ...

application/pdf

PDF (2MB)
• (2005-06)
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in ...

application/pdf

PDF (232kB)
• (2007-02)
Collaborative Filtering (CF) is an attractive and reliable recommendation technique. CF is typically implemented using a centralized storage of user profiles and this is a severe privacy danger, since an attack to this ...

application/pdf

PDF (106kB)
• (2007-06)
We consider the problem of verifying the safety of well-structured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have ( possibly) infinitely many control states along with an auxiliary ...

application/pdf

PDF (266kB)
• (2008-01)
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows ...

application/pdf

PDF (193kB)
• (2008-09)
This work develops new automated reasoning techniques for verifying the correctness of equationally specified programs. These techniques are not just theoretical, but have been implemented, and applied to actual program ...

application/pdf

PDF (1MB)
• (2005-10)
Because they are based on large content-addressable memories, load-store queues (LSQs) present implementation challenges in superscalar processors, especially as issue width and number of in-flight instructions are scaled. ...

application/pdf

PDF (198kB)
• (2007-05)
State-space exploration is the essence of model checking and an increasingly popular approach for automating test generation. A key issue in exploration of object-oriented programs is handling the program state, in particular ...

application/pdf

PDF (300kB)