Publications

Found 4258 results
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
S
Moody, J., & Rögnvaldsson T. S. (1997).  Smoothing Regularizers for Projective Basis Function Networks.
Halperin, E., & Stephan D. A. (2009).  SNP Imputation in Association Studies. Nature Biotechnology. 27(4), 349-351.
Liver, B., & Altmann J. (1997).  Social Carrier Recommendation for Selecting Services in Electronic Telecommunication Markets: A Preliminary Report.
Marczak, B., & Paxson V. (2017).  Social Engineering Attacks on Government Opponents: Target Perspectives. Proceedings on Privacy Enhancing Technologies. 2, 152-164.
Shastri, L., & Wendelken C. (1999).  Soft Computing in Shruti -- A neurally plausible model of reflexive reasoning and relational information processing. Proceedings of the Third International Symposium on Soft Computing. 741-747.
Baraldi, A., & Schenato L.. (1999).  Soft-to-Hard Model Transition in Clustering: A Review.
Goldreich, O., & Ostrovsky R. (1993).  Software Protection and Simulation on Oblivious RAMs.
Blum, M. E., & Wasserman H. (1994).  Software Reliability via Run-Time Result-Checking.
van Huu, L. (1993).  A Software Reuse System for C Codes.
Raghavan, B., Casado M., Koponen T., Ratnasamy S., Ghodsi A., & Shenker S. J. (2012).  Software-Defined Internet Architecture: Decoupling Architecture from Infrastructure. 43-48.
Shenker, S. J. (2012).  Software-Defined Networking: History, Hype, and Hope.
Tschantz, M. Carl, Afroz S., Anonymous, & Paxson V. (2016).  SoK: Towards Grounding Censorship Circumvention in Empiricism. IEEE Symposium on Security and Privacy.
Weaver, N. (2020).  The SolarWinds Breach: Why Your Work Computers Are Down Today.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1991).  Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Shenker, S. J. (1987).  Some Conjectures on the Behavior of Acknowledgement-Based Transmission Control of Random Access Communication Channels. Proceedings of the 1987 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '87). 245-255.
Feldman, J. (1971).  Some Decidability Results on Grammatical Inference and Complexity. Information and Control. 20(3), 244-262.
Feldman, J. (1972).  Some Decidability Results on Grammatical Inference and Complexity. 20(3), 244-262.
Formella, A. (1994).  Some MPEG Decoding Functions on Spert - An Example for Assembly Programmers.
Shenker, S. J., Zhang L., & Clark D. D. (1990).  Some Observations on the Dynamics of a Congestion Control Algorithm. ACM SIGCOMM Computer Communication Review. 20(5), 30-39.
Fillmore, C. J. (1971).  Some Problems for Case Grammar. Report of the 22nd Annual Roundtable Meeting on Linguistics and Language Studies. 35-56.
Feldman, J. (1961).  Some Regularity Theorems on Kernel Methods of Summation for Functions of a Complex Variable.
Feldman, J., & Williams G. (1978).  Some Remarks on Data Types.
Sperduti, A. (1993).  On Some Stability Properties of the LRAAM Model.
Portnoff, R. S., Lee L. N., Egelman S., Mishra P., Leung D., & Wagner D. (2015).  Somebody's Watching Me? Assessing the Effectiveness of Webcam Indicator Lights. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI ’15).
Barrett, L., Feldman J., & Dermed L. Mac (2006).  A (Somewhat) New Solution to the Binding Problem.

Pages