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 
E
Karp, R. M., & Rabin M.. O. (1987).  Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development. 31(2), 249-260.
Quattoni, A., Carreras X.., Collins M., & Darrell T. (2009).  An Efficient Projection for L-1/L-Infinity Regularization.
Stolcke, A. (1993).  An Efficient Probabilistic Context-Free Parsing Algorithm That Computes Prefix Probabilities.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1996).  Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica. 16(4-5), 517-542.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1993).  Efficient PRAM Simulation on a Distributed Memory Machine.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1992).  Efficient PRAM simulation on a distributed memory machine. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
Faria, A., & Gelbart D. (2005).  Efficient Pitch-Based Estimation of VTLN Warp Factors. Proceedings of the 9th European Conference on Speech Communication and Technology (Interspeech 2005-Eurospeech 2005). 213-216.
Bohnet, B. (2009).  Efficient Parsing of Syntactic and Semantic Dependency Structures.
DeNero, J., Bansal M., Pauls A., & Klein D. (2009).  Efficient Parsing for Transducer Grammars. 227-235.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO).
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the 3MIS Problem.
Dahlhaus, E., Karpinski M., & Kelsen P. (1992).  An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Brockmann, K., & Wanka R. (1996).  Efficient Oblivious Parallel Sorting on the MasPar MP-1.
Shenker, S. J. (1990).  Efficient Network Allocations with Selfish Users. Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance '90). 279-285.
Szyperski, C., & Ventre G. (1993).  Efficient Multicasting for Interactive Multimedia Applications.
Hoffman, J., Rodner E., Donahue J., Darrell T., & Saenko K. (2013).  Efficient Learning of Domain-Invariant Image Representations.
Storn, R. (1995).  Efficient Input Reordering for the DCT Based on a Real-Valued Decimation in Time FFT.
Etzioni, O., Hanks S., Jiang T., & Karp R. M. (1996).  Efficient Information Gathering on the Internet. Proceedings. Thirty-Seventh Annual Symposium Foundations of Computer Science. 234-243.
Turau, V., & Chen W. (1995).  Efficient Implementation of Multi-Methods for Statically Typed Languages.
Heun, V., & Mayr E. W. (1998).  Efficient Dynamic Embeddings of Binary Trees into Hypercubes.
Mandal, A., Vergyri D., Wang W., Zheng J., Stolcke A., Tur G., et al. (2008).  Efficient Data Selection for Machine Translation. 261-264.
Günther, O. (1992).  Efficient Computation of Spatial Joins.
Codenotti, B., & Margara L. (1992).  Efficient Clustering Techniques for the Geometric Traveling Salesman Problem.
Bradonjic, M.., Elsässer R., Friedrich T., Sauerwald T., & Stauffer A. (2010).  Efficient Broadcast on Random Geometric Graphs. 1412-1421.
Karmarkar, N., & Karp R. M. (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.

Pages