Publications
Export 566 results:
Author [ Title] Type Year Filters: First Letter Of Last Name is V [Clear All Filters]
2009. Unsupervised view and rate invariant clustering of video sequences. Computer Vision and Image Understanding. 113(3):353-371.
2005. Unsupervised learning applied to progressive compression of time-dependent geometry. Computers & Graphics. 29(3):451-461.
2004. Ubistatins Inhibit Proteasome-Dependent Degradation by Binding the Ubiquitin Chain. Science. 306(5693):117-120.
2004. Ubistatins Inhibit Proteasome-Dependent Degradation by Binding the Ubiquitin Chain. Science. 306(5693):117-120.
2005. A Type and Effect System for Flexible Abstract Interpretation of Java: (Extended Abstract). Electronic Notes in Theoretical Computer Science. 131:111-124.
2002. Two techniques for reconciling algorithm parallelism with memory constraints. Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. :95-98.
1993. Two dimensional pattern matching in a digitized image. Combinatorial Pattern Matching. :134-151.
2008. Trellis: a platform for building flexible, fast virtual networks on commodity hardware. Proceedings of the 2008 ACM CoNEXT Conference. :72:1–72:6-72:1–72:6.
2006. TreePlus: Interactive Exploration of Networks with Enhanced Tree Layouts. Visualization and Computer Graphics, IEEE Transactions on. 12(6):1414-1426.
2010. Transit portal: BGP connectivity as a service. ACM SIGCOMM Computer Communication Review. 40(4):463-464.
1983. Trade-offs between depth and width in parallel computation. Foundations of Computer Science, 1983., 24th Annual Symposium on. :146-153.
1999. Trade-offs between communication throughput and parallel time. Journal of Complexity. 15(1):148-166.
1994. Trade-offs between communication throughput and parallel time. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. :372-381.
2007. Towards Realizing a PRAM-On-Chip Vision. Workshop on Highly Parallel Processing on a Chip (HPPC). 28
2006. Towards Dependability in Everyday Software Using Software Telemetry. Engineering of Autonomic and Autonomous Systems, IEEE International Workshop on. :9-18.
1991. Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.
2003. Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. Theory of Computing Systems. 36(5):521-552.
1998. Topology simplification for polygonal virtual environments. Visualization and Computer Graphics, IEEE Transactions on. 4(2):133-144.
1994. Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima. SIAM Journal on Computing. 23(3):449-465.
2011. Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on. :1282-1291.
1986. Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.