Publication Search Results

TitleAuthorBibliographicsort descendingDateGroupLinks
Recent Developments in SAIL--An Algol Based Language for Artificial IntelligenceJ.A. Feldman, et.alCS 308, Stanford University. Also in Proceedings of the Fall Joint Computer Conference, pp. 1193-1202, Anaheim, California, 1972August 1973AI
AL, A Programming System for AutomationJ.A. Feldman, R. Finkel, R. Taylor, R. Bolles, and R. PaulCS 456, Stanford AI Lab, Stanford UniversityNovember 1974AI
Translator Writing SystemsJ.A. Feldman and D. GriesCS 69, Computer Science Department, Stanford UniversityJune 1967AI
Putting Linguistics into Speech Recognition: The Regulus Grammar CompilerM. Rayner, B.A. Hockey, and P. BouillonCSLI PressMay 2006Speech
World Color SurveyP. Kay, B. Berlin, L. Maffi, W. R. Merrifield, and R. CookCSLI Publications 2010AI
Connectionist Models and Parallelism in High Level VisionJ.A. FeldmanCVGIP, Special Issue on in Human and Machine Vision, Vol. 31, pp. 178-200. Also TR146, Computer Science Department, University of Rochester, New York 1985AI
Connectionist Representation of ConceptsJ.A. FeldmanD. Waltz and J. A. Feldman (eds.), Connectionist Models and Their Applications 1988AI
Prospects for Axion DetectionJ. MoodyDark Matter in the Universe: Proceedings of IAU Symposium 117, Princeton, New JerseyJune 1985Algorithms
Understanding Natural TextureJ.A. Feldman, C. Brown, and J. MalesonDARPA Image Understanding WorkshopOctober 1977AI
Large Scale Malicious Code: A Research AgendaN. Weaver, V. Paxson, S. Staniford, and R. CunninghamDARPA-sponsored report 2003Networking
Reinforcement Learning for Trading Systems and PortfoliosJ. Moody, M. Saffell, Y. Liao, and L. WuDecision Technologies for Computational Finance, Proceedings of the London Conference, A.N. Refenes, N. Burgess and J. Moody, eds., Kluwer Financial Publishing, 1998. 1998Algorithms
Optimization of Trading Systems and PortfoliosJ. Moody and L. WuDecision Technologies for Financial Engineering, Y. Abu-Mostafa, A. N. Refenes, and A. S. Weigend, eds., World Scientific, London, 1997. 1997Algorithms
What is the True Price? -- State Space Models for High Frequency FX RatesJ. Moody and L. WuDecision Technologies for Financial Engineering, Y. Abu-Mostafa, A. N. Refenes, and A. S. Weigend, eds., World Scientific, London, 1997. 1997Algorithms
Markov Chains for Robust Graph-Based Commonsense Information ExtractionN. Tandon, D. Rajagopal, and G. de MeloDemo at the 24th International Conference on Computational Linguistics (COLING), Mumbai, IndiaDecember 2012AI
OpenWordNet-PT: An Open Brazilian WordNet for ReasoningC. de Paiva, A. Rademaker, and G. de MeloDemo at the 24th International Conference on Computational Linguistics (COLING), Mumbai, IndiaDecember 2012AI
Shark: Fast Data Analysis Using Coarse-grained Distributed MemoryC. Engle, A. Lupher, R. Xin, M. Zaharia, M. Franklin, S. Shenker, and I. StoicaDemo, ACM SIGMOD/PODS Conference, Scottsdale, ArizonaMay 2012Networking[PDF]

Comparative Analysis of Traffic Matrix Estimation MethodsA. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. DiotDIMACS Workshop on Internet and WWW Measurement, Mapping and Modeling. February 13-15 2002.February 13 2002Networking
"Corpus linguistics" vs. "computer-aided armchair linguistics"C.J. FillmoreDirections in Corpus Linguistics: Proceedings from a 1991 Nobel Symposium on Corpus Linguistics. Stockholm: Mouton de Gruyter, pp. 35-66 1991AI
Cluster Graph Modification ProblemsR. Shamir, R. Sharan, and D. TsurDiscrete Applied MathematicsJanuary 05 2004Algorithms
Parametric Shortest Path Algorithms with an Application to Cyclic StaffingR. M. Karp and J.B. OrlinDiscrete Applied Mathematics (Netherlands), Vol. 3, No. 1, pp. 37-45February 1981Algorithms
Optimal Fully Dynamic Algorithms for Cograph RecognitionR. Shamir and R. SharanDiscrete Applied Mathematics 136, pp. 329-340January 05 2004Algorithms
Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem.D. Gusfield, R.M. Karp, L. Wang, and P. StellingDiscrete Applied Mathematics, 9 Nov. 1998, vol.88, (no.1-3):167-80. 1998Algorithms
Average-Case Analysis of Incremental Topological OrderingD. Ajwani and T. FriedrichDiscrete Applied Mathematics, Vol. 158, Issue 4, pp. 240-250February 2010Algorithms[PDF]

Subtree isomorphism is in random NCP.B. Gibbons, R. M. Karp, G.L. Miller, and D. SorokerDiscrete Applied Mathematics, Vol. 29, No. 1, pp. 35-62November 1990Algorithms
An introduction to randomized algorithmsR. M. KarpDiscrete Applied Mathematics, Vol. 34, No. 1-3. Also in the proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, D.C., pp. 165-201November 21 1991Algorithms
Two Special Cases of the Assignment ProblemR. M. Karp and S. LiDiscrete Mathematics (Netherlands), Vol. 13, No. 2, pp. 129-42October 1975Algorithms
A Characterization of the Minimum Cycle Mean in a DigraphR. M. KarpDiscrete Mathematics (Netherlands), Vol. 23, No. 3, pp. 309-11September 1978Algorithms
George Dantzig's Impact on the Theory of ComputationR. M. KarpDiscrete Optimization, Vol. 5, Issue 2, pp. 174-185May 2006Algorithms
Incentives and Internet ComputationJ. Feigenbaum and S. ShenkerDistributed Computing Column #9, SIGACT News, Vol. 33, Issue 4, pp. 37-54 2002Networking
Mechanism Design for Policy RoutingJ. Feigenbaum, R. Sami, and S. ShenkerDistributed Computing, Vol. 18, Issue. 4, pp. 150-164March 2006Networking[PDF]

Java Security Architecture and ExtensionsV. RothDr. Dobbs Journal, 2002(335), April 2002.April 2002Networking
Explicit Transport Error Notification (ETEN) for Error-Prone Wireless and Satellite Networks - SummaryR. Krishnan, M. Allman, C. Partridge, J.P.G. Sterbenz, and W. IvancicEarth Science Technology Conference, Pasadena, California, June 2002.June 2002Networking
Multiple Sequence Alighment with Arbitrary Gap Costs: Computing an Optimal Solution Using Polydhedral CombinatoricsE. Althaus, A. Caprara, H.P. Lenhof, and K. ReinertECCB, 4-16, 2002. 2002Algorithms
Algorithms for Graph Partitioning on the Planted Partition Model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques.)A. Condon and R.M. KarpEdited by: Hochbaum, D., Jansen, K., Rolim, J.D.P., Sinclair, A. Berlin, Germany: Springer-Verlag, 1999. pp. 221-32, ix+287 pp. 14 1999Algorithms
The Design and Implementation of a Declarative Sensor Network SystemD. Chu, L. Popa, A. Tavakoli, J. Hellerstein, P. Levis, S. Shenker, and I. StoicaEECS Department, UC Berkeley Technical Report No. EECS-2006-132, Berkeley, CaliforniaOctober 2006Networking
Large-Scale Reconstruction of Haplotype Structure via Perfect PhylogenyE. Eskin, E. Halperin, and R.M. KarpEECS Department, UC Berkeley Technical Report No. UCB/CSD 2-1196, Berkeley, CaliforniaAugust 2002Algorithms[PDF]

Large-Scale Recovery of Haplotypes from Genotype Data Using Imperfect PhylogenyE. Halperin and E. EskinEECS Department, UC Berkeley Technical Report No. UCB/CSD-1-1196, Berkeley, CaliforniaAugust 2002Algorithms[PDF]

Detecting Hidden Causality in Network ConnectionsJ. Kannan, J. Jung, V. Paxson, and C. E. KoksalEECS Department, UC Berkeley Technical Report No. UCB/EECS-2005-30, Berkeley, CaliforniaDecember 2005Networking[PDF]

Flush: A Reliable Bulk Transport Protocol for Multihop Wireless NetworkS. Kim, R. Fonseca, P.K. Dutta, A. Tavakoli, D.E. Culler, P. Levis, S. Shenker, and I. StoicaEECS Department, UC Berkeley Technical Report No. UCB/EECS-2006-169, Berkeley, CaliforniaDecember 12 2006Networking
The Ratio Method for Multi-View Color ConstancyT. Owens, K. Saenko, A. Chakrabarti, Y. Xiong, T. Zickler, and T. DarrellEECS Department, UC Berkeley Technical Report No. UCB/EECS-2011-23, Berkeley, CaliforniaApril 2011Vision[PDF]

The RISC-V Instruction Set Manual, Volume I: Base User-Level ISAA. Waterman, Y. Lee, D. Patterson, and K. AsanovicEECS Department, UC Berkeley Technical Report No. UCB/EECS-2011-62, Berkeley, CaliforniaMay 2011Architecture[PDF]

Algorithms to Detect Multi-Protein Modularity Conserved During EvolutionL. Hodgkinson and R. M. KarpEECS Department, UC Berkeley Technical Report No. UCB/EECS-2011-7, Berkeley, CaliforniaJanuary 2011Algorithms
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster ComputingM. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. Franklin, S. Shenker, and I. StoicaEECS Department, UC Berkeley Technical Report No. UCB/EECS-2011-82, Berkeley, CaliforniaJuly 2011Networking[PDF]

Hypervisors as a Foothold for Personal Computer Security: An Agenda for the Research CommunityM. Zaharia, S. Katti, C. Grier, V. Paxson, S. Shenker, I. Stoica and D. SongEECS Department, UC Berkeley Technical Report No. UCB/EECS-2012-12, Berkeley, CaliforniaJanuary 2012Networking[PDF]

The Parallel Computing Laboratory at UC Berkeley: A Research Agenda Based on the Berkeley ViewK. Asanovic, R. Bodik, J. Demmel, T. Keaveny, K. Keutzer, J. D. Kubiatowicz, E. A. Lee, N. Morgan, G. Necula, D. A. Patterson, K. Sen, J. Wawrzynek, D. Wessel, and K. A. YelickEECS Department, UC Berkeley Technical Report No. UCB/EEECS-2008-23, Berkeley, CaliforniaMarch 2008Architecture[PDF]

Post Placement C-Slow Retiming for the Xilinx Virtex FPGAN. Weaver, Y. Markovskiy, Y. Patel, and J. WawrzynekEleventh ACM Symposium of Field Programmable Gate Arrays (FPGA) 2003Networking[PDF]

End-Host Controlled Multicast RoutingK. Lakshminarayanan, A. Rao, I. Stoica, and S. ShenkerElsevier Computer Networks, Special Issue on Overlay Distribution Structures and their Applications, Vol. 5, Issue 6, pp. 807-825. DOI:10.1016/j.comnet.2005.07.019April 2006Networking[PDF]

DIFS: A Distributed Index for Features in Sensor NetworksB. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, and S. ShenkerElsevier Journal of Ad Hoc Networks, 2003. (Also in the First IEEE Workshop on Sensor Networks Protocols and Applications, SNPA, 2003) 2003Networking
The International Computer Science InstituteJ.A. FeldmanEncyclopedia of Artificial Intelligence, Second Edition, John Wiley & Sons, Inc. 1992AI
Constraining Computational Models of CognitionT. RegierEncyclopedia of Cognitive Science, L. Nadel, ed., pp. 611-615, Macmillan 2003AI

Pages