Publications
Export 325 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is A [Clear All Filters]
2006. System and method for locating a closest server in response to a client .... 09/726,192(7020698)
2006. Exploiting independence for branch operations in Bayesian learning of C&RTs. Probabilistic, Logical and Relational Learning-Towards a Synthesis.
2009. Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica. 55(1):205-226.
2006. Provable algorithms for parallel generalized sweep scheduling. Journal of Parallel and Distributed Computing. 66(6):807-821.
2006. Open problems in relational data clustering. Proceedings of the ICML Workshop on Open Problems in Stastistical Relational Learning.
2009. Measuring General Relational Structure Using the Block Modularity Clustering Objective. Twenty-Second International FLAIRS Conference.
2007. Data Clustering with a Relational Push-Pull Model. Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on. :189-194.
2009. A Fast, Virtualized Data Plane for the NetFPGA. NetFPGA Developers Workshop, Stanford, California. :90-94.
2010. Building a fast, virtualized data plane with programmable hardware. SIGCOMM Comput. Commun. Rev.. 40(1):75-82.
2010. SwitchBlade: a platform for rapid deployment of network protocols on programmable hardware. SIGCOMM Comput. Commun. Rev.. 40(4):183-194.
2010. Network I/O fairness in virtual machines. Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures. :73-80.
1998. DHCP++: Applying an efficient implementation method for fail-stop cryptographic protocols. Proceedings of Global Internet (GlobeCom)’98. :59-65.
1998. Automated recovery in a secure bootstrap process. Proceedings of the Symposium on Network and Distributed Systems Security (NDSS’98). :155-167.
1997. A secure and reliable bootstrap architecture. , 1997 IEEE Symposium on Security and Privacy, 1997. Proceedings. :65-71.
2009. Improved approximation algorithms for prize-collecting Steiner tree and TSP. 2009 50th Annual IEEE Symposium on Foundations of Computer Science. :427-436.
2005. Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration. Human-Computer Interaction - INTERACT 2005Human-Computer Interaction - INTERACT 2005. 3585:835-846.
2005. Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration (2005). Institute for Systems Research Technical Reports.
2009. Visual overviews for discovering key papers and influences across research fronts. Journal of the American Society for Information Science and Technology. 60(11):2219-2228.
2007. Designing Semantic Substrates for Visual Network Exploration. Information VisualizationInformation Visualization. 6(4):281-300.