Publications

Found 4258 results
Author [ Title(Asc)] 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 
F
Moody, J. (1989).  Fast Learning in Multi-Resolution Hierarchies.
Reischuk, R. (1989).  Fast Evaluation of Boolean Formulas by CREW-PRAMs.
Damaskos, S., & Verma D. C. (1989).  Fast Establishment of Real-Time Channels.
Luby, M., & Vigoda E. (1999).  Fast Convergence of the Glauber Dynamics for Sampling Independent Sets: Part I.
Vigoda, E. (1999).  Fast Convergence of the Glauber Dynamics for Sampling Independent Sets: Part II.
DeNero, J., Chiang D.., & Knight K.. (2009).  Fast Consensus Decoding over Translation Forests.
Yeh, T., Lee J. J., & Darrell T. (2009).  Fast Concurrent Object Localization and Recognition. 280-287.
Tesema, F. B., Awada A., Viering I., Simsek M., & Fettweis G. (2016).  Fast Cell Select for Mobility Robustness in Intra-frequency 5G Ultra Dense Networks. Proceedings of International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC) 2016.
Paxson, V. (1997).  Fast, Approximate Synthesis of Fractional Gaussian Noise for Generating Self-Similar Network Traffic. Computer Communication Review. 27(5), 5-18.
Zamir, O.., Etzioni O., Madani O.., & Karp R. M. (1997).  Fast and Intuitive Clustering of Web Documents. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining. 287-290.
Zaharia, M., Chowdhury M., Das T., Dave A., Ma J., McCauley M., et al. (2012).  Fast and Interactive Analytics Over Hadoop Data with Spark. USENIX ;login:. 34(4), 45-51.
Codenotti, B., Datta B. N., Datta K., & Leoncini M. (1994).  Fast and Efficient Parallel Algorithms for Problems in Control Theory.
Baran, Y., Pasaniuc B., Sankararaman S., Torgerson D. G., Gignoux C., Eng C., et al. (2012).  Fast and Accurate Inference of Local Ancestry in Latino Populations. Bioinformatics. 28(10), 1359-1367.
Darken, C., & Moody J. (1990).  Fast, Adaptive K-Means Clustering: Some Empirical Results. Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN 1990).
Salfner, F., & Wolter K. (2008).  Fast Abstract: Replication vs. Failure Precention--How to Boost Service Availability?. Proceedings of the 19th International Symposium on Software Reliability Engineering (ISSRE 2008). 289-290.
Docio, L.., Gelbart D., & Morgan N. (2003).  Far-Field ASR on Inexpensive Microphones. Proceedings of Eighth European Conference on Speech Communication and Technology (EUROSPEECH 2003). 2141-2144.
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
Karp, R. M. (2006).  Fair Bandwidth Allocation Without Per-Flow State. 88-110.
Friedman, E. J., Gkatzelis V., Psomas C-A., & Shenker S. J. (2019).  Fair and Efficient Memory Sharing: Confronting Free Riders. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence.
Gibson, G. A., Hellerstein L., Karp R. M., Katz R. H., & Patterson D. (1989).  Failure correction techniques for large disk arrays. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III). 123-132.
Salzmann, M., Ek C. Henrik, Urtasun R., & Darrell T. (2010).  Factorized Orthogonal Latent Spaces. 701-708.
Virtanen, S., Jia Y., Klami A., & Darrell T. (2012).  Factorized Multi-Modal Topic Model.
Jia, Y., Salzmann M., & Darrell T. (2010).  Factorized Latent Spaces with Structured Sparsity. 982-990.
Morgan, N., & Bourlard H. (1992).  Factoring Networks by a Statistical Method. Neural Computation. 835-838.
Morgan, N., & Bourlard H. (1992).  Factoring Networks by a Statistical Method. Neural Computation. 835-838.

Pages