Publications

Export 7148 results:
[ Author(Desc)] Title 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
Feamster N, Nayak A, Kim H, Clark R, Mundada Y, Ramachandran A, bin Tariq M.  2010.  Decoupling policy from configuration in campus and enterprise networks. Local and Metropolitan Area Networks (LANMAN), 2010 17th IEEE Workshop on. :1-6.
Feamster N, Wee S.  1999.  An MPEG-2 to H. 263 transcoder. SPIE Voice, Video, and Data Communications Conference.
Feamster N, Jung J, Balakrishnan H.  2005.  An empirical study of "bogon" route advertisements. SIGCOMM Comput. Commun. Rev.. 35(1):63-70.
Feamster N.  2010.  Outsourcing home network security. Proceedings of the 2010 ACM SIGCOMM workshop on Home networks. :37-42.
Feamster N, Gray A.  2008.  Can great research be taught?: independent research with cross-disciplinary thinking and broader impact Proceedings of the 39th SIGCSE technical symposium on Computer science education. :471-475.
Feamster N, Bansal D, Balakrishnan H.  2001.  On the interactions between layered quality adaptation and congestion control for streaming video. 11th International Packet Video Workshop.
Feamster N, Johari R, Balakrishnan H.  2005.  Stable Policy Routing with Provider Independence. MIT-CSAIL-TR-2005-009
Feamster N, Borkenhagen J, Rexford J.  2003.  Guidelines for interdomain traffic engineering. SIGCOMM Comput. Commun. Rev.. 33(5):19-30.
Feamster N.  2004.  Practical verification techniques for wide-area routing. SIGCOMM Comput. Commun. Rev.. 34(1):87-92.
Feamster N, Johari R, Balakrishnan H.  2007.  Implications of Autonomy for the Expressiveness of Policy Routing. Networking, IEEE/ACM Transactions on. 15(6):1266-1279.
Feamster N, Rexford J.  2007.  Network-Wide Prediction of BGP Routes. Networking, IEEE/ACM Transactions on. 15(2):253-266.
Feamster N, Balakrishnan H.  2005.  Correctness properties for Internet routing. Allerton Conference on Communication, Control, and Computing.
Feamster N.  2006.  Can Information from End Systems Improve Routing. Proceedings of the Workshop on Internet Routing Evolution and Design.
Feamster N, Voellmy A, Agarwal A, Hudak P, Burnett S, Launchbury J.  2010.  Don't Configure the Network, Program It! Domain-Specific Programming Languages for Network Systems. YALEU/DCS/RR-1432
Feamster N, Dingledine R.  2004.  Location diversity in anonymity networks. Proceedings of the 2004 ACM workshop on Privacy in the electronic society. :66-76.
Feamster N, Motiwala M, Vempala S.  2007.  Path splicing with network slicing. Proc. ACM SIGCOMM Hot-Nets.
Feamster N, Balazinska M, Wang W, Balakrishnan H, Karger D.  2003.  Thwarting Web Censorship with Untrusted Messenger Discovery. Privacy Enhancing TechnologiesPrivacy Enhancing Technologies. 2760:125-140.
Feamster N, Balakrishnan H.  2004.  Verifying the Correctness of Wide-Area Internet Routing. MIT-CSAIL-TR-2004-031
Feamster N, Johari R, Balakrishnan H.  2005.  Implications of autonomy for the expressiveness of policy routing. Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications. :25-36.
Fedder GK, Blanton S, Carley LR, Gupta SK, Koester D.  2001.  Integrated Microelectromechanical System (MEMS) Inertial Measurement Unit (IMIMU).
Fei Wu P, Qu Y, Fleischmann K, Golbeck J, Jaeger P, Preece J, Shneiderman B.  2008.  Designing community-based emergency communication system: A preliminary study. Proceedings of the American Society for Information Science and Technology. 45(1):1-3.
Feige U, Halldórsson MM, Kortsarz G, Srinivasan A.  2003.  Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.
Fekete J-D, Plaisant C.  2004.  Les leçons tirées des deux compétitions de visualisation d'information. Proceedings of the 16th conference on Association Francophone d'Interaction Homme-Machine. :7-12.
Fekete JD, Wang D, Dang N, Aris A, Plaisant C.  2003.  Overlaying graph links on treemaps. IEEE Symposium on Information Visualization Conference Compendium (demonstration).
Fekete J-D, Plaisant C.  1999.  Excentric labeling: dynamic neighborhood labeling for data visualization. Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit. :512-519.

Pages