Publications

Found 111 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Title is N  [Clear All Filters]
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 
N
Karp, R. M., & Hopcroft J.. E. (1973).  An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing. 2(4), 225-231.
Peters, N., Lei H., & Friedland G. (2012).  Name That Room: Room Identification Using Acoustic Features in a Recording. 841-844.
Stoyanchev, S.., Tur G., & Hakkani-Tür D. (2008).  Name-Aware Speech Recognition for Interactive Question Answering. 5113-5116.
Ghodsi, A., Koponen T., Rajahalme J., Sarolahti P., & Shenker S. (2011).  Naming in Content-Oriented Architectures. 1-6.
Lei, H. (2008).  NAP, WCCN, a New Linear Kernel, and a Keyword Weighting for the HMM Supervector Speaker Recognition System.
Friedland, G., Janin A., & Gottlieb L. (2013).  Narrative Theme Navigation for Sitcoms Supported by Fan-Generated Scripts. Multimedia Tools and Applications. 63(2), 387-406.
Friedland, G., Gottlieb L., & Janin A. (2010).  Narrative-Theme Navigation for Sitcoms Supported by Fan-Generated Scripts. 3-8.
Maier, G., Schneider F., & Feldmann A. (2011).  NAT Usage in Residential Broadband Networks.
Feldman, J., Trott S., & Khayrallah H. (2015).  Natural Language For Human Robot Interaction.
Hu, R., Xu H., Rohrbach M., Feng J., Saenko K., & Darrell T. (2016).  Natural Language Object Retrieval. The IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
Bilmes, J. A. (1999).  Natural Statistical Models for Automatic Speech Recognition.
Bilmes, J. A. (1999).  Natural Statistical Models for Automatic Speech Recognition.
Metere, A. (2018).  Is nature really chaotic and fractal, or did we just imagine it?.
Hemmerling, A. (1993).  Navigation Without Perception of Coordinates and Distances.
Tuytelaars, T., Fritz M., Saenko K., & Darrell T. (2011).  The NBNN Kernel. 1824-1831.
Pan, V. (1992).  The NC Equivalence of Integer Linear Programming and Euclidean GCD.
Härtig, H. (1994).  Near or Far.
El-Yaniv, R., & Karp R. M. (1997).  Nearly Optimal Competitive Online Replacement Policies. 22,
Karp, R. M., McKellar A.. C., & Wong C.. K. (1975).  Near-optimal Solutions to a 2-dimensional Placement Problem. SIAM Journal on Computing. 4(3), 271-286.
Friedrich, T., & Sauerwald T. (2009).  Near-Perfect Load Balancing by Randomized Rounding. 121-130.
Fillmore, C. J. (1977).  The need for a frame semantics in linguistics. 12, 5-29.
Kreibich, C., Weaver N., Nechaev B., & Paxson V. (2010).  Netalyzr: Illuminating Edge Network Neutrality, Security, and Performance.
Kreibich, C., Weaver N., Nechaev B., & Paxson V. (2010).  Netalyzr: Illuminating The Edge Network. 246-259.
Panda, A., Han S., Walls M., Ratnasamy S., & Shenker S. (2016).  NetBricks: Taking the V out of NFV. Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI ’16).
Chun, B-G., Ratnasamy S., & Kohler E. (2008).  NetComplex: A Complexity Metric for Network System Designs. Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2008). 393-406.

Pages