default search action
Balas K. Natarajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
- [j17]Balas K. Natarajan:
On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor. SIAM J. Comput. 29(3): 712-727 (1999) - 1998
- [j16]Balas K. Natarajan, Konstantinos Konstantinides, Cormac Herley:
Occam filters for stochastic sources with application to digital images. IEEE Trans. Signal Process. 46(5): 1434-1438 (1998) - [j15]Balas K. Natarajan, Konstantinos Konstantinides, Cormac Herley:
Correction To "occam Filters For Stochastic Sources With Application To Digital Images". IEEE Trans. Signal Process. 46(6): 1777 (1998) - 1997
- [j14]Balas K. Natarajan, Vasudev Bhaskaran, Konstantinos Konstantinides:
Low-complexity block-based motion estimation via one-bit transforms. IEEE Trans. Circuits Syst. Video Technol. 7(4): 702-706 (1997) - [j13]Konstantinos Konstantinides, Balas K. Natarajan, Gregory S. Yovanof:
Noise estimation and filtering using block-based singular value decomposition. IEEE Trans. Image Process. 6(3): 479-483 (1997) - 1996
- [j12]Prasad Tadepalli
, Balas K. Natarajan:
A Formal Framework for Speedup Learning from Problems and Solutions. J. Artif. Intell. Res. 4: 445-475 (1996) - [c18]Balas K. Natarajan, Vasudev Bhaskaran, Konstantinos Konstantinides:
Low-complexity algorithm and architecture for block-based motion estimation via one-bit transforms. ICASSP 1996: 3244-3247 - [c17]Balas K. Natarajan, Konstantinos Konstantinides, Cormac Herley:
Occam filters for stochastic sources with application to digital images. ICIP (1) 1996: 399-402 - [c16]Konstantinos Konstantinides, Vasudev Bhaskaran, Balas K. Natarajan:
Effects of noise pre-filtering for codebook generation in vector quantization. ICIP (3) 1996: 455-458 - [c15]Scott A. Mahlke, Balas K. Natarajan:
Compiler Synthesized Dynamic Branch Prediction. MICRO 1996: 153-164 - [i1]Prasad Tadepalli, Balas K. Natarajan:
A Formal Framework for Speedup Learning from Problems and Solutions. CoRR cs.AI/9605105 (1996) - 1995
- [j11]B. K. Natarajan:
Sparse Approximate Solutions to Linear Systems. SIAM J. Comput. 24(2): 227-234 (1995) - [j10]B. K. Natarajan:
Filtering random noise from deterministic signals via data compression. IEEE Trans. Signal Process. 43(11): 2595-2605 (1995) - [c14]B. K. Natarajan, Vasudev Bhaskaran:
A fast approximate algorithm for scaling down digital images in the DCT domain. ICIP 1995: 241-243 - 1994
- [j9]Konstantinos Konstantinides, Balas K. Natarajan:
An architecture for lossy compression of waveforms using piecewise-linear approximation. IEEE Trans. Signal Process. 42(9): 2449-2454 (1994) - [c13]B. K. Natarajan:
Sharper Bounds on Occam Filters with Application to Digital Video. Data Compression Conference 1994: 440-449 - [c12]Balas K. Natarajan, Vasudev Bhaskaran:
Effective nearly lossless compression of digital video sequences via motion-compensated filtering. ICASSP (5) 1994: 441-444 - [c11]Konstantinos Konstantinides, Balas K. Natarajan:
Algorithm and architecture: for non-linear noise filtering via piecewise linear compression. ICASSP (2) 1994: 489-492 - 1993
- [j8]B. K. Natarajan:
Condition-Sensitive Computation of Approximate Fixed Points. J. Complex. 9(3): 406-411 (1993) - [j7]B. K. Natarajan:
A Reply to Hellerstein's Book Review of Machine Learning: A Theoretical Approach. Mach. Learn. 13: 151-152 (1993) - [c10]B. K. Natarajan:
Occam's Razor for Functions. COLT 1993: 370-376 - [c9]B. K. Natarajan:
Filtering Random Noise via Data Compression. Data Compression Conference 1993: 60-69 - [c8]Vasudev Bhaskaran, Balas K. Natarajan, Konstantinos Konstantinides:
Optimal Piecewise-Linear Compression of Images. Data Compression Conference 1993: 168-177 - 1992
- [j6]B. K. Natarajan:
Probably Approximate Learning Over Classes of Distributions. SIAM J. Comput. 21(3): 438-449 (1992) - 1991
- [b2]Balas K. Natarajan:
Machine Learning: A Theoretical Approach. Morgan Kaufmann 1991, ISBN 1-55860-148-1 - [j5]B. K. Natarajan:
Probably Approximate Learning of Sets and Functions. SIAM J. Comput. 20(2): 328-351 (1991) - 1990
- [c7]B. K. Natarajan:
On Computing the Intersection of B-Splines (Extended Abstract). SCG 1990: 157-167
1980 – 1989
- 1989
- [j4]B. K. Natarajan:
Some Paradigms for the Automated Design of Parts Feeders. Int. J. Robotics Res. 8(6): 98-109 (1989) - [j3]B. K. Natarajan:
On Learning Sets and Functions. Mach. Learn. 4: 67-97 (1989) - [j2]B. K. Natarajan:
An analysis of assembly. Vis. Comput. 5(5): 316-323 (1989) - [c6]B. K. Natarajan:
On Learning from Exercises. COLT 1989: 72-87 - 1988
- [j1]B. K. Natarajan:
The Complexity of Fine Motion Planning. Int. J. Robotics Res. 7(2): 36-42 (1988) - [c5]B. K. Natarajan:
On Planning Assemblies. SCG 1988: 299-308 - [c4]Balas K. Natarajan, Prasad Tadepalli:
Two New Frameworks for Learning. ML 1988: 402-415 - 1987
- [c3]B. K. Natarajan:
On Detecting the Orientation of Polygons and Polyhedra. SCG 1987: 147-152 - [c2]B. K. Natarajan:
On Learning Boolean Functions. STOC 1987: 296-304 - 1986
- [b1]Balas K. Natarajan:
On Moving and Orienting Objects. Cornell University, USA, 1986 - [c1]B. K. Natarajan:
An Algorithmic Approach to the Automated Design of Parts Orienters. FOCS 1986: 132-142
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: