Found 4214 results
Author Title [ Type(Desc)] Year
Technical Report
Randall, D., & Sinclair A. (1993).  Testable Algorithms for Self-Avoiding Walks.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  On the Theory of Average Case Complexity (Revised Edition).
Blum, L. (1990).  A Theory of Computation and Complexity Over the Real Numbers.
Blum, L., Shub M., & Smale S. (1988).  On a Theory of Computation and Complexity Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines.
Arnold, O.., & Jantke K.. P. (1994).  Therapy Plan Generation in Complex Dynamic Environments.
Friedland, G., Elizalde B. Martinez, Lei H., & Divakaran A. (2012).  There is No Data Like Less Data: Percepts for Video Concept Detection on Consumer-Produced Media.
Holtkamp, M. (1997).  Thread Migration with Active Threads.
Hadziosmanovic, D., Sommer R., Zambon E., & Hartel P. (2013).  Through the Eye of the PLC: Towards Semantic Security Monitoring for Industrial Control Systems.
Herrtwich, R. Guido (1990).  Time Dated Streams in Continuous-Media Systems.
Feldman, J. (1988).  Time, Space and Form in Vision.
Feldman, J. (1988).  Time, Space, and Form in Vision.
Fortino, G., Nigro L., & Albanese A. (1999).  A Time-Sensitive Actor Framework in Java for the Development of Multimedia Systems over the Internet MBone.
Asanović, K., & Johnson D. (1996).  Torrent Architecture Manual.
Kaiser, M. (1993).  Towards a Cognitively Based Approach of a Description of Spatial Deixis.
Aberer, K., & Codenotti B. (1992).  Towards a Complexity Theory for Approximation.
Ellsworth, M. (2011).  Towards a Representation for Understanding the Structure of Multiparty Conversations.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  Towards a Theory of Average Case Complexity.
Nechaev, B., Paxson V., Allman M., Bennett M., & Gurtov A. (2013).  Towards Methodical Calibration: A Case Study of Enterprise Switch Measurements.
Sander, T., & Tschudin C. F. (1997).  Towards Mobile Cryptography.
Cleve, R. (1990).  Towards Optimal Simulations of Formulas by Bounded-Width Programs.
Ermolinskiy, A., Katti S., Shenker S. J., Fowler L. L., & McCauley M. (2010).  Towards Practical Taint Tracking.
Bonzon, P. E. (1995).  A Tower Architecture for Meta-Level Inference Systems Based on Omega-OrderedHorn Theories.
Knightly, E. W., & Zhang H. (1994).  Traffic Characterization and Switch Utilization Using a Deterministic Bounding Interval Dependent Traffic Model.
Colombetti, M., & Dorigo M. (1993).  Training Agents to Perform Sequential Behavior.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.