Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KOPLOWITZ J")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 14 of 14

  • Page / 1
Export

Selection :

  • and

ON THE PERFORMANCE OF CHAIN CODES FOR QUANTIZATION OF LINE DRAWINGSKOPLOWITZ J.1981; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1981; VOL. 3; NO 2; PP. 180-185; BIBL. 9 REF.Article

FINITE MEMORY HYPOTHESIS TESTING WITH DEPENDENT SAMPLESKOPLOWITZ J.1979; IEEE TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 2; PP. 210-213; BIBL. 19 REF.Article

NECESSARY AND SUFFICIENT MEMORY SIZE FOR M-HYPOTHESIS TESTING.KOPLOWITZ J.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 1; PP. 44-46; BIBL. 6 REF.Article

ON IMPROVING LINE DETECTION IN NOISY IMAGESZABELE GS; KOPLOWITZ J.1979; PATTERN RECOGNITION AND IMAGE PROCESSING. INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS COMPUTER SOCIETY. CONFERENCE ON PATTERN RECOGNITION AND IMAGE PROCESSING/1979/CHICAGO IL; USA; NEW YORK: IEEE; DA. 1979; PP. 146-149; BIBL. 10 REF.Conference Paper

ON THE RELATION OF PERFORMANCE TO EDITING IN NEAREST NEIGHBOR RULESKOPLOWITZ J; BROWN TA.1981; PATTERN RECOGN.; ISSN 0031-3203; USA; DA. 1981; VOL. 13; NO 3; PP. 251-255; BIBL. 7 REF.Article

A MORE EFFICIENT CONVEX HULL ALGORITHM.KOPLOWITZ J; JOUPPI D.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 1; PP. 56-57; BIBL. 1 REF.Article

ON THE RELATION OF PERFORMANCE TO EDITING IN NEAREST NEIGHBORS RULESKOPLOWITZ J; BROWN TA.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 214-216; BIBL. 7 REF.Conference Paper

Design of perimeter estimators for digitized planar shapesKOPLOWITZ, J; BRUCKSTEIN, A. M.IEEE transactions on pattern analysis and machine intelligence. 1989, Vol 11, Num 6, pp 611-622, issn 0162-8828Article

Fourier encoding of closed planar boundariesZABELE, G. S; KOPLOWITZ, J.IEEE transactions on pattern analysis and machine intelligence. 1985, Vol 7, Num 1, pp 98-102, issn 0162-8828Article

On bit reduction of chain coded line drawingsSUNDAR RAJ, P. A; KOPLOWITZ, J.Pattern recognition letters. 1986, Vol 4, Num 2, pp 99-102, issn 0167-8655Article

On Cover's consistent estimatorKOPLOWITZ, J; STEIF, J. E; NERMAN, O et al.Scandinavian journal of statistics. 1995, Vol 22, Num 3, pp 395-397, issn 0303-6898Article

The number of digital straight lines on an N × N gridKOPLOWITZ, J; LINDENBAUM, M; BRUCKSTEIN, A et al.IEEE transactions on information theory. 1990, Vol 36, Num 1, pp 192-197, issn 0018-9448Article

Tree searched chain coding for subpixel reconstruction of planar curvesRAGHAVACHARI SRIRAMAN; KOPLOWITZ, J; SESHADRI MOHAN et al.IEEE transactions on pattern analysis and machine intelligence. 1989, Vol 11, Num 1, pp 95-104, issn 0162-8828Article

On the performance of edited nearest neighbor rules in high dimensionsBRODER, A. Z; BRUCKSTEIN, A. M; KOPLOWITZ, J et al.IEEE transactions on systems, man, and cybernetics. 1985, Vol 15, Num 1, pp 136-139, issn 0018-9472Article

  • Page / 1