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 
A
Andrade H, Kurc T, Sussman A, Saltz J.  2002.  Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs. 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2002. :154-154.
André P, White R, Tan D, Berners-Lee T, Consolvo S, Jacobs R, Kohane I, Le Dantec CA, Mamykina L, Marsden G.  2009.  Interacting with eHealth: towards grand challenges for HCI. Proceedings of the 27th international conference extended abstracts on Human factors in computing systems. :3309-3312.
Andrei P, Mayergoyz ID.  2003.  Random doping-induced fluctuations of subthreshold characteristics in MOSFET devices. Solid-State Electronics. 47(11):2055-2061.
Andrews M, Shepherd B, Srinivasan A, Winkler P, Zane F.  2002.  Clustering and server selection using passive monitoring. IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 3:1717-1725vol.3-1717-1725vol.3.
Andrews M, Hofmann M, Shepherd B, Srinivasan A, Winkler P, Zane F.  2006.  System and method for locating a closest server in response to a client .... 09/726,192(7020698)
Angelopoulos N, Cussens J, De Raedt L, Dietterich T, Getoor L, Muggleton SH.  2006.  Exploiting independence for branch operations in Bayesian learning of C&RTs. Probabilistic, Logical and Relational Learning-Towards a Synthesis.
Anil Kumar V, Marathe M, Parthasarathy S, Srinivasan A.  2009.  Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica. 55(1):205-226.
Anil Kumar VS, Marathe MV, Parthasarathy S, Srinivasan A, Zust S.  2006.  Provable algorithms for parallel generalized sweep scheduling. Journal of Parallel and Distributed Computing. 66(6):807-821.
Anthony A, desJardins M.  2007.  Data Clustering with a Relational Push-Pull Model. Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on. :189-194.
Anthony A, desJardins M.  2006.  Open problems in relational data clustering. Proceedings of the ICML Workshop on Open Problems in Stastistical Relational Learning.
Anthony A P, desJardins M, Lombardi M.  2009.  Measuring General Relational Structure Using the Block Modularity Clustering Objective. Twenty-Second International FLAIRS Conference.
Antonakakis M, Perdisci R, Dagon D, Lee W, Feamster N.  2010.  Building a dynamic reputation system for DNS. 19th Usenix Security Symposium.
Anwer M B, Motiwala M, Bin Tariq M, Feamster N.  2010.  SwitchBlade: a platform for rapid deployment of network protocols on programmable hardware. SIGCOMM Comput. Commun. Rev.. 40(4):183-194.
Anwer MB, Feamster N.  2009.  A Fast, Virtualized Data Plane for the NetFPGA. NetFPGA Developers Workshop, Stanford, California. :90-94.
Anwer M B, Feamster N.  2010.  Building a fast, virtualized data plane with programmable hardware. SIGCOMM Comput. Commun. Rev.. 40(1):75-82.
Anwer M B, Nayak A, Feamster N, Liu L.  2010.  Network I/O fairness in virtual machines. Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures. :73-80.
Aoshima S, Phillips C, Weinberg A.  2003.  On-line computation of two types of structural relations in Japanese.
Apostolico A, Iliopoulos C, Landau GM, Schieber B, Vishkin U.  1988.  Parallel construction of a suffix tree with applications. Algorithmica. 3(1):347-365.
Aravamudan M, Kumaran K, Ramakrishnan K G, Srinivasan A.  2004.  Method of designing signaling networks for internet telephony. : 09/517,658(6687363)
Arbaugh WA, Keromytis AD, Farber DJ, Smith JM.  1998.  Automated recovery in a secure bootstrap process. Proceedings of the Symposium on Network and Distributed Systems Security (NDSS’98). :155-167.
Arbaugh WA, Farber DJ, Smith JM.  1997.  A secure and reliable bootstrap architecture. , 1997 IEEE Symposium on Security and Privacy, 1997. Proceedings. :65-71.
Arbaugh WA, Fithen WL, McHugh J.  2000.  Windows of Vulnerability: A Case Study Analysis. Computer. 33(12):52-59.
Arbaugh WA, Keromytis AD, Smith JM.  1998.  DHCP++: Applying an efficient implementation method for fail-stop cryptographic protocols. Proceedings of Global Internet (GlobeCom)’98. :59-65.
Arbaugh WA, Davin JR, Farber DJ, Smith JM.  1998.  Security for virtual private intranets. Computer. 31(9):48-55.
Archer A, Bateni MH, Hajiaghayi MT, Karloff H.  2009.  Improved approximation algorithms for prize-collecting Steiner tree and TSP. 2009 50th Annual IEEE Symposium on Foundations of Computer Science. :427-436.

Pages