Publications
Found 1144 results
Author [ Title![(Desc)](https://icsi.berkeley.edu/icsi/sites/all/modules/biblio/misc/arrow-desc.png)
Filters: First Letter Of Last Name is K [Clear All Filters]
(2007).
Dynamic Classifier Combinations in Hybrid Speech Recognition Systems Using Utterance-Level Confidence Values.
Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1999).
(1999). Dynamic Programming Meets the Principle of Inclusion and Exclusion.
Operations Research Letters. 1(2), 49-51.
(1982). Dynamic Route Recomputation Considered Harmful.
ACM Computer Communication Review. 40(2), 66-71.
(2010). Dynamic Stream Weighting for Turbo-Decoding-Based Audiovisual ASR.
Proceedings of Interspeech 2016.
(2016).
(2009).
(2009).
Edge correlations in spatial networks.
Journal of Complex Networks. 1-14.
(2016). Editorial: Architecting for Innovation.
ACM SIGCOMM Computer Communication Review. 41(3), 24-36.
(2011). Editorial: Architecting for Innovation.
ACM SIGCOMM Computer Communication Review. 41(3), 24-36.
(2011).
(2008).
(2007).
(2011). On the Effects of Adding Objectives to Plateau Functions.
IEEE Transactions on Evolutionary Computation. 13(3), 591-603.
(2009).
(2011).
(2008).
(2008). The Efficiency of Resolution and Davis-Putnamn Procedures.
31(4), 1048-1075.
(2002). Efficient 3D analysis of laminate structures using ABD-equivalent material models.
Finite Elements in Analysis and Design. 106, 41-55.
(2015). Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks.
Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 133-144.
(2005). Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks.
Journal of Computational Biology. 13, 133-144.
(2006).
(1994). An efficient approximation scheme for the one-dimensional bin-packing problem.
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. 312-320.
(1982). An efficient approximation scheme for the one-dimensional bin-packing problem.
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. 312-320.
(1982). Efficient Information Gathering on the Internet.
Proceedings. Thirty-Seventh Annual Symposium Foundations of Computer Science. 234-243.
(1996).