Publications

Found 4258 results
Author Title [ Type(Asc)] Year
Journal Article
Stoica, I., Shenker S. J., & Zhang H. (2003).  Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High-Speed Networks. IEEE/ACM Transactions on Networking. 11(1), 33-46.
Mahajan, R., Bellovin S. M., Floyd S., Ioannidis J., Paxson V., & Shenker S. J. (2002).  Controlling High Bandwidth Aggregates in the Network. ACM SIGCOMM Computer Communication Review. 32(3), 62-73.
Atkins, B.. T. S., Rundell M., & Sato H. (2003).  The Contribution of Framenet to Practical Lexicography. International Journal of Lexicography.
Bourlard, H., & Morgan N. (1993).  Continuous Speech Recognition by Connectionist Statistical Methods. IEEE Transactions on Neural Networks. 4(6), 893-909.
Feldman, J. (2000).  Context and Causality in Cognitive Science.
de Melo, G., & Weikum G. (2012).  Constructing and Utilizing Wordnets using Statistical Methods. Journal of Language Resources and Evaluation. 46(2), 287-311.
Pathak, D., Kraehenbuehl P., Yu S. X., & Darrell T. (2015).  Constrained Structured Regression with Convolutional Neural Networks. CoRR. abs/1511.07497,
Floyd, S. (1991).  Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: One-way Traffic. Computer Communication Review. 21(5), 30-47.
Feldman, J. (1990).  Connectionist Systems. Annual Review of Computer Science. 4, 369-383.
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.
[Anonymous] (1988).  Connectionist Models and Their Applications. (Waltz, D.., & Feldman J., Ed.).
Feldman, J. (1985).  Connectionist Models and Their Applications. 9(1), 1-2.
Feldman, J. (1985).  Connectionist Models and Parallelism in High Level Vision. CVGIP. 31, 178-200.
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., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
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.
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.
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.
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.
Shastri, L. (2002).  A Computationally Efficient Abstraction of Long-term Potentiation. Neurocomputing. 44-46, 33-41.
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.
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Feldman, J. A. (2022).  Computation, perception, and mind. Behavioral and Brain Sciences. 45,
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Feldman, J., & Curry J.. (1967).  The Compiler-compiler in a Time-Sharing Environment. Bit Dropper.

Pages