Publications
Export 1435 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is K [Clear All Filters]
1992. copia-like retrotransposons are ubiquitous among plants. Proc Natl Acad Sci USA. 89(15):7124-7128.
1992. On the difficulty of Manhattan channel routing. Information Processing Letters. 44(5):281-284.
1992. Efficient minimum cost matching using quadrangle inequality. Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on. :583-592.
1992. Efficient minimum cost matching using quadrangle inequality. Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on. :583-592.
1992. Hierarchical curve representation. , 11th IAPR International Conference on Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings. :143-146.
1992. Incremental construction and dynamic maintenance of constrained Delaunay triangulations. Proceedings of the 4th Canadian Conference on Computational Geometry. :170-175.
1992. Multi-resolution shape description by corners. , 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92. :271-276.
1992. Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
1992. VLSI Architectures and Implementation of Predictive Tree- Searched Vector Quantizers for Real-Time Video Compression. ISR-TR-1992-48
1992. VLSI Implementation of Real-Time Parallel DCT/DST Lattice Structures for Video. ISR-TR-1992-34
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.
1991. Editing to structure a reader's experience. Hypertext/hypermedia handbookHypertext/hypermedia handbook. :143-164.
1991. Fully deadline-coupled planning: One step at a time. Methodologies for Intelligent Systems. :589-599.
1991. A pipeline N-way join algorithm based on the 2-way semijoin program. IEEE Transactions on Knowledge and Data Engineering. 3(4):486-495.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
1991. Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
1991. Reasoning about ignorance: A note on the Bush-Gorbachev problem. Fundam. Inform.. 15(3-4):325-332.
1990. An efficient parallel algorithm for channel routing. Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings., 1990 IEEE International Conference on. :400-403.
1990. Extending planar graph algorithms to K3,3-free graphs. Information and Computation. 84(1):13-25.