triceratops

Browsing Computer Science by Author "Lindell, Steven"

TriCollege Digital Repository

Browsing Computer Science by Author "Lindell, Steven"

Sort by: Order: Results:

  • Dworkin, Lili Anne (2011)
    When designing hardware or software, it is important to ensure that systems behave correctly. This is particularly crucial for life- or safety-critical systems, in which errors can be fatal. One approach to the formal ...
  • Bejile, Brian (2004)
    Image compression algorithms have evolved into some of the most complex structures in computing. Yet at the core of these algorithms are simple techniques that have been long known about data compression. This paper ...
  • Belasco, Mark (1992)
  • Tolles, Bryant F. III (1990)
  • Cao, Chang (2013)
    In this paper, we consider two problems related to counting problems in complexity theory. First, we use the reachability method to prove that nondeterministic logarithm space is closed under complement. Then, we consider ...
  • Griffin, Ashley (2014)
    Optimization of route planning is essential to everyday tasks such as planning trips and traffic simulation. In order to optimize routes in large graphs such as transportation networks, an algorithm must be able to quickly ...
  • Caspari, Adam (2015)
    One of the most fundamental concepts in graph theory is connectivity, or the property that a path exists between two vertices in a given graph. The property of connectivity may be extended into biconnectivity and ...
  • Weinstein, Lee (2005)
    This paper is an empirical study mainly of graph properties for various graphs including both deterministic graphs, those with a set structure, and random graphs. The main properties that are analyzed are graph diameter, ...
  • Huttner, Joseph (2009)
    This paper is a survey of the algorithms that power recommender systems. To start, the social and monetary relevance of recommender systems is outlined. Then we delve into the specifics of how the first recommender system, ...
  • Okun, Harry (2016)
    We collect the proofs and lemmas which enable linear time algorithms for first-order sentences on graph classes with bounded expansion. Bounded expansion is a property limiting the edge to vertex ratio of a graph and its ...
  • Block, Aaron (2002)
    Quantum computers may provide a significant speed increase over classical computation. In order to fully exploit quantum computation, we need to have a firm mathematical understanding of quantum computation at its smallest ...
  • Surti, Tanvi (2011)
    The vision for Web 3.0 (popularly referred to as the Semantic Web) is the ability to create meaning out of a deluge of qualitative data. This paper explores a very specific instance of the Semantic Web – Social Recommender ...
  • Seralathan, Ashanthi Meena (2011)
    Traditionally, artificial intelligence (AI) algorithms have not been built on particularly adaptive principles. Systems were created using complex collections of rules that were created specifically for the purpose at ...

Search


Advanced Search

Browse

My Account