Publications

Export 7151 results:
Author [ Title(Desc)] 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 
L
Narayanan A, Elaine Shi, Rubinstein BIP.  2011.  Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge. :1825-1834.
Bilgic M, Getoor L.  2009.  Link-based active learning. NIPS Workshop on Analyzing Networks and Learning with Graphs.
Sen P, Getoor L.  2007.  Link-based Classification. UMIACS-TR-2007-11
Getoor L.  2005.  Link-based classification. Advanced methods for knowledge discovery from complex data. :189-207.
Basili VR, Lindvall M, Regardie M, Seaman C, Heidrich J, Munch J, Rombach D, Trendowicz A.  2010.  Linking Software Development and Business Strategy Through Measurement. Computer. 43(4):57-65.
Lacroix Z, Murthy H, Naumann F, Raschid L.  2004.  Links and paths through life sciences data sources. Data Integration in the Life Sciences. :203-211.
Ryu KW, JaJa JF.  1989.  List ranking on the Hypercube. Proceedings of the 1989 International Conference on Parallel Processing. 3:20-23.
Zhao H, Smith BK, Norman KL, Plaisant C, Shneiderman B.  2005.  Listening to Maps: User Evaluation of Interactive Sonifications of Geo-Referenced Data. Institute for Systems Research Technical Reports.
Zhao H, Smith BK, Norman KL, Plaisant C, Shneiderman B.  2005.  Listening to Maps: User Evaluation of Interactive Sonifications of Geo-Referenced Data (2004). Institute for Systems Research Technical Reports.
Kim H, Voellmy A, Burnett S, Feamster N, Clark R.  2012.  Lithium: Event-Driven Network Control. GT-CS-12-03
Koivisto A, Pietkainen P, Sauvola J, Doermann D.  2000.  Live multimedia adaptation through wireless hybrid networks. Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on. 3:1697-1700vol.3-1697-1700vol.3.
JaJa JF, Ryu K W.  1992.  Load balancing and routing on the hypercube and related networks. Journal of Parallel and Distributed Computing. 14(4):431-435.
JaJa JF, Ryu KW.  1990.  Load balancing on the hypercube and related networks. Proceedings of 1990 International Conference on Parallel Processing. 1:203-210.
Bhatia R, Khuller S, Naor J(S).  2000.  The Loading Time Scheduling Problem. Journal of Algorithms. 36(1):1-33.
Taylor EM, Martin, M.P, Weirs VG.  2004.  Local Adaption and Dissipation Properties of a Weighted Essentially Non-Oscillatory Scheme. 34th AIAA Fluid Dynamics Conference and Exhibit.
Srinivasan A.  2011.  Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
McFadden FE, Peng Y, Reggia JA.  1993.  Local conditions for phase transitions in neural networks with variable connection strengths. Neural networks. 6(5):667-676.
Guo JK, Doermann D, Rosenfeld A.  1997.  Local correspondence for detecting random forgeries. Document Analysis and Recognition, 1997., Proceedings of the Fourth International Conference on. 1:319-323vol.1-319-323vol.1.
Du X, Smolka SA, Cleaveland R.  1999.  Local model checking and protocol analysis. International Journal on Software Tools for Technology Transfer (STTT). 2(3):219-241.
Panconesi A, Srinivasan A.  1995.  The local nature of Δ-coloring and its algorithmic applications. Combinatorica. 15(2):255-280.
Williams LR, Jacobs DW.  1997.  Local Parallel Computation of Stochastic Completion Fields. Neural Computation. 9(4):859-881.
Schwartz W, Davis LS, Pedrini H.  2011.  Local Response Context Applied to Pedestrian Detection. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. :181-188.
Agarwala R, Batzoglou S, DančíK V, Decatur SE, Hannenhalli S, Farach M, Muthukrishnan S, Skiena S.  1997.  Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. Journal of Computational Biology. 4(3):275-296.
Khuller S, Bhatia R, Pless R.  2000.  On local search and placement of meters in networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :319-328.
Kanungo T, Mount D, Netanyahu NS, Piatko CD, Silverman R, Wu AY.  2002.  A local search approximation algorithm for k-means clustering. Proceedings of the eighteenth annual symposium on Computational geometry. :10-18.

Pages