B. K. Natarajan

20 papers A* 4B 3Journal 10Unranked 3

Year	Rank	Type	Title / Venue / Authors
1995	B	`conf`	A fast approximate algorithm for scaling down digital images in the DCT domain. ICIP B. K. Natarajan, Vasudev Bhaskaran
1995	J	`jnl`	Filtering random noise from deterministic signals via data compression. IEEE Trans. Signal Process. B. K. Natarajan
1995	J	`jnl`	Sparse Approximate Solutions to Linear Systems. SIAM J. Comput. B. K. Natarajan
1994	B	`conf`	Sharper Bounds on Occam Filters with Application to Digital Video. Data Compression Conference B. K. Natarajan
1993	J	`jnl`	A Reply to Hellerstein's Book Review of Machine Learning: A Theoretical Approach. Mach. Learn. B. K. Natarajan
1993	J	`jnl`	Condition-Sensitive Computation of Approximate Fixed Points. J. Complex. B. K. Natarajan
1993	B	`conf`	Filtering Random Noise via Data Compression. Data Compression Conference B. K. Natarajan
1993	A*	`conf`	Occam's Razor for Functions. COLT B. K. Natarajan
1992	J	`jnl`	Probably Approximate Learning Over Classes of Distributions. SIAM J. Comput. B. K. Natarajan
1991	J	`jnl`	Probably Approximate Learning of Sets and Functions. SIAM J. Comput. B. K. Natarajan
1990	—	`conf`	On Computing the Intersection of B-Splines (Extended Abstract). SCG B. K. Natarajan
1989	J	`jnl`	An analysis of assembly. Vis. Comput. B. K. Natarajan
1989	J	`jnl`	On Learning Sets and Functions. Mach. Learn. B. K. Natarajan
1989	A*	`conf`	On Learning from Exercises. COLT B. K. Natarajan
1989	J	`jnl`	Some Paradigms for the Automated Design of Parts Feeders. Int. J. Robotics Res. B. K. Natarajan
1988	—	`conf`	On Planning Assemblies. SCG B. K. Natarajan
1988	J	`jnl`	The Complexity of Fine Motion Planning. Int. J. Robotics Res. B. K. Natarajan
1987	—	`conf`	On Detecting the Orientation of Polygons and Polyhedra. SCG B. K. Natarajan
1987	A*	`conf`	On Learning Boolean Functions STOC B. K. Natarajan
1986	A*	`conf`	An Algorithmic Approach to the Automated Design of Parts Orienters FOCS B. K. Natarajan