# Browse Dept. of Computer Science by Title

• (2012-06-27)
Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning of PGMs. Answering questions ...

application/pdf

PDF (2MB)
• (2014-05-30)
Probabilistic Relational Graphical Model (PRGM) is a popular tool for modeling uncertain relational knowledge, of which the set of uncertain relational knowledge is usually assumed to be independent with the domain of the ...

application/pdf

PDF (786kB)
• (2010-09)
We present a lifted inference algorithm for relational hybrid graphical models. Hybrid graphical models with continuous and discrete variables naturally represent many real-world applications in robotics, financial ...

application/pdf

PDF (257kB)
• (2013-02-03)
As real-time embedded systems become more complex, there is a desire to use these systems on higher performance commercial off-the-shelf (COTS) components. However, worst case execution times (WCET) are unreasonably high ...

application/pdf

PDF (1MB)
• (2004-11)
The Web has been rapidly deepened" by myriad searchable databases online, where data are hidden behind query forms. Helping users query alternative deep Web" sources in the same domain (\eg, Books, Airfares) is an ...

application/pdf

PDF (263kB)
• (2012-09-18)
Malicious software is rampant on the Internet and costs billions of dollars each year. Safe and thorough analysis of malware is key to protecting vulnerable systems and cleaning those that have already been infected. Most ...

application/pdf

PDF (235kB)
• (2007-04)
In distributed proof construction systems, information release policies can make it unlikely that any single node in the system is aware of the complete structure of any particular proof tree. This property makes it difficult ...

application/pdf

PDF (286kB)
• (2013-08-22)
Security monitoring systems have been recognized as a fundamental component of security management, and they provide the fundamental building blocks of future reactive and autonomic systems that can automatically respond ...

application/pdf

PDF (2MB)
• (2011-02-24)
Random Oracles have proven to be extremely powerful constructs in cryptography and they can be used to realize several useful cryptographic primitives which are, otherwise, impossible in the plain model. In this work, we ...

application/pdf

PDF (289kB)
• (2011-09-02)
The efficiency of multi-hop communication is a function of the time required for data transfer, or throughput. A key determinant of throughput is the reliability of packet transmission, as measured by the packet reception ...

application/pdf

PDF (541kB)
• (2003-12)
Power management is an important technique to prolong the lifetime of battery-powered wireless ad hoc networks. The fact that the energy consumed in the idle state dominates the total power consumed on wireless network ...

application/pdf

PDF (195kB)
• (1975)

application/pdf

PDF (2MB)
• (2008-10)
Wireless sensor networks promise an unprecedented potential for observing the physical world. Their battery life, however, is usually the bottleneck that limits application lifetime, a problem that is exacerbated by the ...

application/pdf

PDF (3MB)
• (2008)
Because these three problems are closely related to the role played by energy, we call the overall LiteArch architecture energy-centric. The immediate implications of LiteArch is that it can improve the performance of the ...

application/pdf

PDF (3MB)
• (2008-10)
Wireless sensor networks promise an unprecedented potential for observing the physical world. Their battery life, however, is usually the bottleneck that limits application lifetime, a problem that is exacerbated by the ...

application/pdf

PDF (3MB)
• (2003)
Traffic engineering (TE) is crucial in hop-by-hop OSPF networks. We present a novel, edge-based traffic engineering method to approximate the optimal traffic allocation. The new method uses bandwidth-sensitive hop-by-hop ...

application/pdf

PDF (7MB)
• (2011-01-14)
Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors (now cores). However, these strategies often do ...

application/pdf

PDF (629kB)
• (1983)
In 1974, Dennis Ritchie and Ken Thompson published their now famous paper The UNIX1 Time-Sharing System in Communications of the ACr..L In 1978, approximately 1000 computers ran the UNIX system world wide. By 1982 this ...

application/pdf

PDF (24MB)
• (2001)
Programs are called stateful when they manipulate the state of a computer explicitly, for example, by assignment. The main theme of the thesis is reasoning about stateful programs. In fact, for the past 30 years, significant ...

application/pdf

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