Publications
Export 566 results:
Author [ Title] Type Year Filters: First Letter Of Last Name is V [Clear All Filters]
2010. Forensic hash for multimedia information. SPIE Media Forensics and Security. :7541–0Y-7541–0Y.
2009. Flexible and efficient querying and ranking on hyperlinked data sources. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. :553-564.
2009. Flexible and efficient querying and ranking on hyperlinked data sources. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. :553-564.
2009. Fingerprinting Compressed Multimedia Signals. Information Forensics and Security, IEEE Transactions on. 4(3):330-345.
1996. FINESSE: a financial information spreadsheet. Information Visualization '96, Proceedings IEEE Symposium on. :70-71,125-70-71,125.
1987. Fine and Medium Grained Parallel Algorithms for Matrix QR Factorization. Algorithms and Applications on Vector and Parallel ComputersAlgorithms and Applications on Vector and Parallel Computers. :347-349.
1981. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
1988. On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
1984. Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
1990. Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
1988. On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
2007. Filtering spam with behavioral blacklisting. Proceedings of the 14th ACM conference on Computer and communications security. :342-351.
1989. Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
1988. Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
1989. Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
1996. A fast parallel algorithm for finding the convex hull of a sorted point set. International Journal of Computational Geometry and Applications. 6:231-242.
2008. Fast monitoring of traffic subpopulations. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement. :257-270.
2006. A Fast k-Neighborhood Algorithm for Large Point-Clouds. Proceedings of the 3rd IEEE/Eurographics Symposium on Point-Based Graphics. ACM, Boston, MA, USA.