Browse by Subject "computer science"

• (2006-03)
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in (received) message overheads at different nodes. This paper presents techniques that leverages ...

application/pdf

PDF (419kB)
• (2008-02-28)
Many institutions of higher education in the US are offering an information technology (IT) education program at an undergraduate level. So far, not many studies about this young academic program have explored students’ ...

application/msword

Microsoft Word (81kB)
• (2007-09)
Topology optimization is a powerful tool for global and multiscale design of structures, microstructures, and materials. The computational bottleneck of topology optimization is the solution of a large number of extremely ...

application/pdf

PDF (5MB)
• (2006-12)
The Web has been rapidly deepened'' by myriad searchable databases online, where data are hidden behind query interfaces. Guarding data behind them, such query interfaces are the entrances'' or doors'' to the deep ...

application/pdf

PDF (2MB)
• (2006-01)
The computational bottleneck of topology optimization is the solution of a large number of linear systems arising in the finite element analysis. We propose fast iterative solvers for large three-dimensional topology ...

application/pdf

PDF (4MB)
• (2006-05)
Transactional memory (TM) is a compelling alternative to traditional synchronization, and implementing TM primitives directly in hardware offers a potential performance advantage over software-based methods. In this paper, ...

application/pdf

PDF (200kB)
• (2008-10)
This dissertation addresses the task of detecting instances of object categories in photographs. We propose modeling an object category as a collection of object parts linked together in a deformable configuration. We ...

application/pdf

PDF (10MB)
• (2008-04)
This dissertation addresses the task of learning to segment images into meaningful material and object categories. With regards to materials we consider the difficult task of segmenting objects made of transparent materials ...

application/pdf

PDF (7MB)
• (2005-08)
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of ...

application/pdf

PDF (232kB)
• (2006-02)
Making high quality and reliable software systems remains a difficult problem. One approach to address this problem is automated verification which attempts to demonstrate algorithmically that a software system meets its ...

application/pdf

PDF (872kB)
• (2005-09)
A challenge in building interruption reasoning systems is to compute an accurate cost of interruption (COI). Prior work has used non task-specific cues to predict COI, but ignore characteristics related to the /structure/ ...

application/pdf

PDF (215kB)
• (2006-05)
Ensuring long-term, or lifetime'' reliability, as dictated by the hard error rate due to wear-out based failures, is a critical requirement for microprocessor manufacturers. At the same time, the steady increases in CMOS ...

application/pdf

PDF (1MB)
• (2006-04)
This dissertation addresses the problems of recognizing textures, objects, and scenes in photographs. We present approaches to these recognition tasks that combine salient local image features with spatial relations and ...

application/pdf

PDF (19MB)
• (2006-03)
Resource reclaiming schemes are applied in reservation-based real-time uniprocessor systems to support efficient reclaiming and sharing of computational resources left unused by early completing tasks, improving the response ...

application/pdf

PDF (202kB)
• (2005-07)
Maintaining frequency counts for data streams has attracted much interest among the research community recently since it provides the base for many stream mining applications. Most existing work followed the same paradigm: ...

application/pdf

PDF (676kB)
• (2006-05)
This thesis addresses the problem of learning manifold from time series. We use the mixtures of probabilistic principal component analyzers (MPPCA) to model the nonliner manifold. In addition, we extend the MPPCA model by ...

application/pdf

PDF (6MB)
• (2009-01)
Hoare logics rely on the fact that logic formulae can encode, or specify, program states, including environments, stacks, heaps, path conditions, data constraints, and so on. Such formula encodings tend to lose the structure ...

application/pdf

PDF (477kB)
• (2006-11)
Unlike most simple textbook examples, the real world is full with complex systems, and researchers in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration ...

application/pdf

PDF (2MB)
• (2008-12)
Extracting causal models from observed executions has proved to be an effective approach to analyze concurrent programs. Most existing causal models are based on happens-before partial orders and/or Mazurkiewicz traces. ...

application/pdf

PDF (431kB)
• (2006-10)
We study the problem of learning large margin halfspaces in various settings using coresets and show that coresets are a widely applicable tool for large margin learning. A large margin coreset is a subset of the input ...

application/pdf

PDF (257kB)