Publications

Found 416 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Title is C  [Clear All Filters]
Journal Article
Narayanan, M.., & Karp R. M. (2007).  Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. Journal of Computational Biology. 14(7), 892-907.
Tantau, T. (2004).  Comparing Verboseness for Finite Automata and Turing Machines. Theory of Computing Systems. 31(1), 95-109.
Radoslavov, P., Papadopoulos C., Govindan R., & Estrin D. (2004).  A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast. IEEE/ACM Transactions on Networking. 469-482.
Marchini, J., Cutler D., Patterson N., Stephens M., Eskin E., Halperin E., et al. (2006).  A Comparison of Phasing Algorithms for Trios and Unrelated Individuals. American Journal of Human Genetics. 78(3), 437-450.
Yaman, S., & Lee C-H. (2008).  A Comparison of Single- and Multi-Objective Programming Approaches to Problems with Multiple Design Objectives. Journal of Signal Processing Systems.
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
Feldman, J., & Curry J.. (1967).  The Compiler-compiler in a Time-Sharing Environment. Bit Dropper.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Feldman, J. A. (2022).  Computation, perception, and mind. Behavioral and Brain Sciences. 45,
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Kimmel, G., Sharan R., & Shamir R. (2004).  Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification and Population Stratification. INFORMS Journal on Computing.
Shastri, L. (2002).  A Computationally Efficient Abstraction of Long-term Potentiation. Neurocomputing. 44-46, 33-41.
Friedland, G. (2007).  Computers and Commerce: A Study of Technology and Management at Eckert-Mauchly Computer Company, Engineering Research Associates, and Remington Rand, 1946-1957 (book review). IEEE Annals of the History of Computing. 29(2), 74-77.
Gairing, M., Lücking T., Mavronicolas M., & Monien B. (2010).  Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory of Computing Systems. 47(2), 405-432.
Alber, J., Gramm J., Guo J., & Niedermeier R. (2004).  Computing the Similarity of Two Sequences with Nested Arc Annotations. Theoretical Computer Science. 312(2-3), 337-358.
Feldman, J., Fanty M. A., Goddard N. H., & Lynne K.. J. (1988).  Computing with Structured Connectionist Networks. Communications of the ACM. 31(2), 170-187.
Feldman, J., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
Lefelhocz, C., Lyles B., Shenker S. J., & Zhang L. (1996).  Congestion Control for Best Effort Service: Why We Need a New Paradigm. IEEE Network Magazine. 10(1), 10-19.
Feldman, J. (1985).  Connectionist Models and Parallelism in High Level Vision. CVGIP. 31, 178-200.
Feldman, J. (1985).  Connectionist Models and Their Applications. 9(1), 1-2.
[Anonymous] (1988).  Connectionist Models and Their Applications. (Waltz, D.., & Feldman J., Ed.).
Renals, S., Morgan N., Bourlard H., Cohen M., & Franco H. (1993).  Connectionist Probability Estimators in HMM Speech Recognition. IEEE Transactions on Speech and Audio Processing.
Feldman, J. (1990).  Connectionist Systems. Annual Review of Computer Science. 4, 369-383.
Floyd, S. (1991).  Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: One-way Traffic. Computer Communication Review. 21(5), 30-47.
Pathak, D., Kraehenbuehl P., Yu S. X., & Darrell T. (2015).  Constrained Structured Regression with Convolutional Neural Networks. CoRR. abs/1511.07497,

Pages