# Browse Dept. of Computer Science by Title

• (2015-01-21)
Graphs are powerful vehicles to represent data objects that are interconnecting or interacting with each other. We explore random walks on various kinds of graph to address different searching and mining scenarios. This ...

application/pdf

PDF (3MB)
• (1978)

application/pdf

PDF (2MB)
• (2009-03-31)
Popular products often attract an astonishing number of user reviews. Sifting through them by the thousands can be quite a headache, one that has inspired solutions like unique phrase identification (e.g., Yelp) and ...

application/pdf

PDF (574kB)
• (1990)
The traditional approach for solving large dynamical systems is time consuming. Waveform method, an iterative technique for solving systems of differential equations, can be used to reduce the processing time. Waveform ...

application/pdf

PDF (4MB)
• (2011-05)
In recent years, multicore processors have been receiving a significant amount of attention from avionic and automotive industries as the demand for high-end real-time applications drastically increases. However, the ...

application/pdf

PDF (802kB)
• (1999)
Finally, we show how to adapt recent advances in statistically-unbiased least-squares methods to our image-based rendering approach. The point-based PIV involves equations with bilinear or higher-order data dependencies ...

application/pdf

PDF (7MB)
• (2004-11)
With its sheer amount of information, the Web is clearly an important frontier for data mining. While Web mining must start with content on the Web, there is no effective search-based'' mechanism to help sifting through ...

application/pdf

PDF (319kB)
• (2008-02)
Well-centered meshes (meshes composed of well-centered simplices) have the advantage of having nice orthogonal dual meshes (the dual Voronoi diagram), which is useful for certain numerical algorithms that require or prefer ...

application/pdf

PDF (889kB)
• (2008-10)
In large software projects often multiple modeling languages are used in order to cover the different domains and views of the application and the language skills of the developers appropriately. Such "multi-modeling" ...

application/pdf

PDF (704kB)
• (2005-05)
Distributed systems are getting bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, there has not been much work in defining or measuring ...

application/pdf

PDF (72kB)
• (2012-10-14)
Mixing the actor model with other concurrency models in a single program can break the actor abstraction. This increases the chance of creating deadlocks and data races—two mistakes that are hard to make with actors. ...

application/pdf

PDF (251kB)
• (2013-11-14)
Adaptation of models to a new domain is important for many natural language tasks. Because without adaptation, NLP tools trained on news domain achieve sub par results on other domains. In many practical scenarios, the ...

application/pdf

PDF (96kB)
• (2008)
Wikipedia, the popular online encyclopedia, has in just six years grown from an adjunct to the now-defunct Nupedia to over 31 million pages and 429 million revisions in 256 languages and spawned sister projects such as ...

application/pdf

PDF (75kB)
• (2013-05-24)
During the spring of 2011 pressure was asserted by the department on the enrollment in CS424 Real-Time Systems due to its low enrollment. The result of that pressure was a curriculum update, removal of the CS431 Embedded ...

application/pdf

PDF (3MB)
• (2001)
The thesis provides experimental results for a few sample programs: three multicast protocols, a messenger carrying remote exception-handling code, a worldwide migrating agent, and a buffering messenger. (Abstract shortened ...

application/pdf

PDF (7MB)
• (1997)
A cycle-stealing DMA I/O task is allowed to proceed only when the CPU does not need the system bus. As a result, the execution time of a cycle-stealing DMA I/O task is affected by a set of CPU tasks which execute concurrently ...

application/pdf

PDF (4MB)
• (2010-05-19)
There are two venues for many-core machines to gain higher performance: increasing the number of processors and number of vector units in one SIMD processor. A truly scalable algorithm should take advantage for both ...

application/pdf

PDF (275kB)
• (2005-08)
With the technical advances in ubiquitous computing and wireless networking, there has been an increasing need to capture the context information (such as the location) and to figure it into applications. In this paper, ...

application/pdf

PDF (2MB)
• (2015-04-28)
Distributed graph processing frameworks have become increasingly popular for processing large graphs. However, existing frameworks either lack the ability to recovery from failures or support proactive recovery methods. ...

application/pdf

PDF (1MB)
• (2015-05-07)
Distributed graph processing systems largely rely on proactive techniques for failure recovery. Unfortunately, these approaches (such as checkpointing) entail a significant overhead. In this paper, we argue that distributed ...

application/pdf

PDF (1MB)