TOP >> PORTLAND STATE UNIVERSITY >> Computer science
 
Browse Institutions
You are viewing titles for PORTLAND STATE UNIVERSITY in the Computer science available through the UMI Dissertations & Thesis Gradwoorks site
 
An empirical assessment of the CAN SPAM Act
 Low-latency Estimates for Window-Aggregate Queries over Data Streams
 
FPGA Implementation & Acceleration of Building blocks for Biologically Inspired Computational Models
 Factoring Semiprimes Using PG2N Prime Graph Multiagent Search
 
On the Effect of Topology on Learning and Generalization in Random Automata Networks
 Hierarchical Temporal Memory Cortical Learning Algorithm for Pattern Recognition on Multi-core Architectures
 
A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture
 An Exploration Of Heterogeneous Networks On Chip
 
The Basic Scheme for the Evaluation of Functional Logic Programs
 Using Dataflow Optimization Techniques with a Monadic Intermediate Language
 
On the Effect of Heterogeneity on the Dynamics and Performance of Dynamical Networks
 A Survey and Analysis of Solutions to the Oblivious Memory Access Problem
 
Object Detection and Recognition in Natural Settings
 A Survey of Systems for Predicting Stock Market Movements, Combining Market Indicators and Machine Learning Classifiers
 
Distributed cooperative framework and algorithms for wireless network performance optimization
 A qualitative analysis of hybrid control systems
 
Semantic components: A model for enhancing retrieval of domain-specific information
 Goal-oriented job scheduling for parallel computer systems
 
Hardware architectures and implementations for associative memories---The building blocks of hierarchically distributed memories
 Window queries over data streams
 
Classical search and quantum search algorithms for synthesis of quantum circuits and optimization of quantum oracles
 Irrelevance, polymorphism, and erasure in type theory
 
Graphical user interfaces as updatable views
 Quantum multiplexers, Parrondo games, and proper quantization
 
Programmer friendly refactoring tools
 A framework for superimposed applications: Techniques to represent, access, transform, and interchange bi-level information
 
Addressing automated adversaries of network applications
 Practical type inference for the GADT type system
 
Synthesis of Reversible Functions Using Various Gate Libraries and Design Specifications
 An Automata-Theoretic Approach to Hardware/Software Co-verification
 
Conceptual Modeling of Data with Provenance
 Scalable and Efficient Tasking for Dynamic Sensor Networks
 
Information Processing in Two-Dimensional Cellular Automata
 High Speed Wireless Networking for 60GHz
 
A Functional Approach to Memory-Safe Operating Systems
 Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures
 
Extending Relativistic Programming to Multiple Writers
 HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs
 
A Data-Descriptive Feedback Framework for Data Stream Management Systems