Publications

Search
Export 481 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is K  [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 
K
Kreitzberg CB, Shneiderman B.  2000.  Making Computer and Internet Usability a Priority. Technical Reports from UMIACS.
Kreitzberg CB, Shneiderman B.  1993.  Restructuring knowledge for an electronic encyclopedia. Sparks of innovation in human-computer interaction. 615:123-123.
Kraus S, Nirkhe M, Perlis D.  1991.  Deadline-coupled real-time planning. Innovative approaches to planning, scheduling and control: proceedings of a Workshop [on Innovative Approaches to Planning, Scheduling, and Control], held at San Diego, California, November 5-8, 1991. :100-100.
Kraus S, V.S. Subrahmanian, Tas NC.  2003.  Probabilistically survivable mass. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 18:789-795.
Kraus S, Perlis D.  1989.  Assessing others' knowledge and ignorance. Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems.
Kraus S, Perlis D, Horty JF.  1991.  Reasoning about ignorance: A note on the Bush-Gorbachev problem. Fundam. Inform.. 15(3-4):325-332.
Kozen D, Teitelbaum T, Chen WZ, Field JH, Pugh W, Vander Zanden BT.  1987.  ALEX-an Alexical Programming Language. TR87-835
Koved L, Shneiderman B.  2008.  Embedded menus: selecting items in context. Sparks of innovation in human-computer interaction.
Kotidis1⋆ Y, Sismanis Y, Roussopoulos N.  2001.  Shared index scans for data warehouses. Data Warehousing and Knowledge Discovery. :307-316.
Kotidis Y, Roussopoulos N.  2001.  A case for dynamic view management. ACM Transactions on Database SystemsACM Trans. Database Syst.. 26(4):388-423.
Kotidis Y, Roussopoulos N.  1998.  An alternative storage organization for ROLAP aggregate views based on cubetrees. ACM Sigmod Record. 27:249-258.
Kotidis Y, Roussopoulos N.  1999.  DynaMat: a dynamic view management system for data warehouses. Proceedings of the 1999 ACM SIGMOD international conference on Management of data. :371-382.
Korpal M, Ell BJ, Buffa FM, Ibrahim T, Blanco MA, Celià-Terrassa T, Mercatali L, Khan Z, Goodarzi H, Hua Y et al..  2011.  Direct targeting of Sec23a by miR-200s influences cancer cell secretome and promotes metastatic colonization. Nature Medicine. 17(9):1101-1108.
Kornhauser D, Wilensky U, Rand W.  2009.  Design guidelines for agent based model visualization. Journal of Artificial Societies and Social Simulation. 12(2):1-1.
Korman CE, Mayergoyz ID.  1994.  The input dependent Preisach model with stochastic input as a model for aftereffect. Magnetics, IEEE Transactions on. 30(6):4368-4370.
Korman CE, Mayergoyz ID.  1995.  Switching as an exit problem. Magnetics, IEEE Transactions on. 31(6):3545-3547.
Korman CE, Adly AA, Mayergoyz ID, Rugkwamsook P.  2000.  A model for magnetic aftereffect in the presence of time varying demagnetizing fields. Magnetics, IEEE Transactions on. 36(5):3182-3184.
Koren S, Treangen TJ, Pop M.  2011.  Bambus 2: scaffolding metagenomes. Bioinformatics. 27(21):2964-2971.
Koponen T, Shenker S, Balakrishnan H, Feamster N, Ganichev I, Ghodsi A, Godfrey BP, McKeown N, Parulkar G, Raghavan B et al..  2011.  Architecting for innovation. SIGCOMM Comput. Commun. Rev.. 41(3):24-36.
Koo C-Y, Bhandari V, Katz J, Vaidya NH.  2006.  Reliable broadcast in radio networks: the bounded collision case. Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing. :258-264.
Konte M, Feamster N.  2012.  Re-wiring Activity of Malicious Networks. Passive and Active MeasurementPassive and Active Measurement. 7192:116-125.
Konte M, Feamster N, Jung J.  2008.  Fast flux service networks: Dynamics and roles in hosting online scams. GT-CS-08-07
Konte M, Feamster N, Jung J.  2009.  Dynamics of online scam hosting infrastructure. Passive and Active Network Measurement. :219-228.
Konte M, Feamster N.  2011.  Wide-area routing dynamics of malicious networks. Proceedings of the ACM SIGCOMM 2011 conference. :432-433.
Konjevod G, Ravi R, Srinivasan A.  2002.  Approximation algorithms for the covering Steiner problem. Random Structures & Algorithms. 20(3):465-482.

Pages