Publications

Export 156 results:
[ Author(Desc)] Title 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 
D
Dao HT, Bazinet A, Berthier R, Shneiderman B.  2008.  NASDAQ Velocity and Forces: An Interactive Visualization of Activity and Change. Journal of Universal Computer Science. 14(9):1391-1410.
Darsa L, Costa Silva B, Varshney A.  1997.  Navigating static environments using image-space simplification and morphing. Proceedings of the 1997 symposium on Interactive 3D graphics.
Daumé H.  2009.  Non-parametric bayesian areal linguistics. Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics. :593-601.
Daumé H, Marcu D.  2004.  Np bracketing by maximum entropy tagging and SVM reranking. Proceedings of EMNLP. 4
Daumé H, Marcu D.  2002.  A noisy-channel model for document compression. Proceedings of the 40th Annual Meeting on Association for Computational Linguistics. :449-456.
De Floriani L, Mesmoudi M, Morando F, Puppo E.  2002.  Non-manifold decomposition in arbitrary dimensions. Discrete Geometry for Computer Imagery. :59-115.
Delogu F, Palmiero M, Federici S, Plaisant C, Zhao H, Belardinelli O.  2010.  Non-visual exploration of geographic maps: Does sonification help? Disability & Rehabilitation: Assistive Technology. 5(3):164-174.
Diehl CP, Getoor L, Namata G.  2006.  Name reference resolution in organizational email archives. SIAM International Conference on Data Mining. :20-22.
DuBois T, Golbeck J, Srinivasan A.  2011.  Network Clustering Approximation Algorithm Using One Pass Black Box Sampling. arXiv:1110.3563.
Dumitras T, Narasimhan P.  2009.  No Downtime for Data Conversions: Rethinking Hot Upgrades (CMU-PDL-09-106). Parallel Data Laboratory.
E
Eisenstat SC, Elman H, Schultz MH, Sherman AH.  1983.  The (new) Yale sparse matrix package. Elliptic problem solvers II. :45-52.
Erman J, Gerber A, Hajiaghayi MT, Pei D, Spatscheck O.  2009.  Network-aware forward caching. Proceedings of the 18th international conference on World wide web. :291-300.
Etherington DW, Kraus S, Perlis D.  1991.  Nonmonotonicity and the scope of reasoning. Artificial Intelligence. 52(3):221-261.
F
Feamster N, Rexford J.  2002.  Network-wide BGP route prediction for traffic engineering. Proceedings of ITCOM.
Feamster N, Rexford J.  2007.  Network-Wide Prediction of BGP Routes. Networking, IEEE/ACM Transactions on. 15(2):253-266.
Fekete SP, Khuller S, Klemmstein M, Raghavachari B, Young N.  1997.  A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Journal of Algorithms. 24(2):310-324.
Fermüller C, Aloimonos Y, Brodský T.  2000.  New eyes for building models from video. Computational Geometry. 15(1–3):3-23.
Fleischer L, Meyerson A, Saniee I, Shepherd FB, Srinivasan A.  2001.  Near-optimal design of MP S tunnels with shared recovery. DIMACS Mini-Workshop on Quality of Service Issues in the Internet.
G
Gaitan M, Mayergoyz ID.  1989.  A numerical analysis for the small-signal response of the MOS capacitor. Solid-State Electronics. 32(3):207-213.
Gao D, Zhuolin Jiang, Ye M.  2008.  A New Approach of Dynamic Background Modeling for Surveillance Information. Computer Science and Software Engineering, 2008 International Conference on. 1:850-855.
Gou H, Swaminathan A, M. Wu.  2007.  Noise Features for Image Tampering Detection and Steganalysis. Image Processing, 2007. ICIP 2007. IEEE International Conference on. 6:VI-97-VI-100-VI-97-VI-100.

Pages