Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Daniel P. Lopresti

Papers on DiSC'04


Quantifying Information Leakage in Document Redaction

Robust Document Image Understanding Technologies

Pictographic matching: a graph-based approach towards a language independent document exploitation platform

Publications


Note: Links lead to the DBLP on the Web.

Daniel P. Lopresti

Henry S. Baird , Daniel P. Lopresti: Human Interactive Proofs, Second International Workshop, HIP 2005, Bethlehem, PA, USA, May 19-20, 2005, Proceedings Springer 2005

Daniel P. Lopresti: Leveraging the CAPTCHA Problem. HIP 2005 : 97-110

Henry S. Baird , Venugopal Govindaraju , Daniel P. Lopresti: Document Analysis Systems for Digital Libraries: Challenges and Opportunities. Document Analysis Systems 2004 : 1-16

Daniel P. Lopresti, Jianying Hu , Ramanujan S. Kashi : Preface. IJDAR 6 (3): 145-145 (2003)

Daniel P. Lopresti, Gordon T. Wilfong : A fast technique for comparing graph representations with applications to performance evaluation. IJDAR 6 (4): 219-229 (2003)

Daniel P. Lopresti, Jianying Hu , Ramanujan S. Kashi : Document Analysis Systems V, 5th International Workshop, DAS 2002, Princeton, NY, USA, August 19-21, 2002, Proceedings Springer 2002

Daniel P. Lopresti: Exploiting WWW Resources in Experimental Document Analysis Research. Document Analysis Systems 2002 : 532-543

Fabian Monrose , Michael K. Reiter , Qi Li , Daniel P. Lopresti, Chilin Shih : Toward Speech-Generated Cryptographic Keys on Resource-Constrained Devices. USENIX Security Symposium 2002 : 283-296

Jianying Hu , Ramanujan S. Kashi , Daniel P. Lopresti, Gordon T. Wilfong : Evaluating the performance of table processing algorithms. IJDAR 4 (3): 140-153 (2002)

Daniel P. Lopresti, George Nagy : Issues in Ground-Truthing Graphic Documents. GREC 2001 : 46-66

Daniel P. Lopresti, Gordon T. Wilfong : Evaluating Document Analysis Results via Graph Probing. ICDAR 2001 : 116-120

Jianying Hu , Ramanujan S. Kashi , Daniel P. Lopresti, Gordon T. Wilfong , George Nagy : Why Table Ground-Truthing is Hard. ICDAR 2001 : 129-133

Daniel P. Lopresti, Gordon T. Wilfong : Comparing Semi-Structured Documents via Graph Probing. Multimedia Information Systems 2001 : 41-50

Daniel P. Lopresti: A Comparison of Text-Based Methods for Detecting Duplication in Scanned Document Databases. Inf. Retr. 4 (2): 153-173 (2001)

Daniel P. Lopresti: String techniques for detecting duplicates in document databases. IJDAR 2 (4): 186-199 (2000)

Daniel P. Lopresti, Jiangying Zhou : Locating and Recognizing Text in WWW Images. Inf. Retr. 2 (2/3): 177-206 (2000)

Daniel P. Lopresti, George Nagy : A Tabular Survey of Automated Table Processing. GREC 1999 : 93-120

Daniel P. Lopresti: Models and Algorithms for Duplicate Document Detection. ICDAR 1999 : 297-300

Daniel P. Lopresti, Gordon T. Wilfong : Cross-Domain Approximate String Matching. SPIRE/CRIWG 1999 : 120-127

Prateek Sarkar , George Nagy , Jiangying Zhou , Daniel P. Lopresti: Spatial Sampling of Printed Patterns. IEEE Trans. Pattern Anal. Mach. Intell. 20 (3): 344-351 (1998)

Daniel P. Lopresti, Matthew Y. Ma , Patrick Shen-Pei Wang , Jill D. Crisman : Ink Matching of Cursive Chinese Handwritten Annotations. IJPRAI 12 (1): 119-141 (1998)

Jiangying Zhou , Daniel P. Lopresti: Extracting Text from WWW Images. ICDAR 1997 : 248-252

Daniel P. Lopresti, Andrew Tomkins : Block Edit Models for Approximate String Matching. Theor. Comput. Sci. 181 (1): 159-179 (1997)

Daniel P. Lopresti: Robust Retrieval of Noisy Text. ADL 1996 : 76-85

Walid G. Aref , Daniel Barbará , Daniel P. Lopresti: Ink as a First-Class Datatype in Multimedia Databases. Multimedia Database System: Issues and Research Direction 1996 : 113-163

Yanhong Li , Daniel P. Lopresti, George Nagy , Andrew Tomkins : Validation of Image Defect Models for Optical Character Recognition. IEEE Trans. Pattern Anal. Mach. Intell. 18 (2): 99-108 (1996)

Daniel P. Lopresti, Jiangying Zhou , George Nagy , Prateek Sarkar : Spatial sampling effects in optical character recognition. ICDAR 1995 : 309-314

Walid G. Aref , Ibrahim Kamel , Daniel P. Lopresti: On Handling Electronic Ink. ACM Comput. Surv. 27 (4): 564-567 (1995)

Dzung T. Hoang , Daniel P. Lopresti: FPL Implementation of Systolic Sequence Alignment. FPL 1992 : 183-191

Richard Hughey , Daniel P. Lopresti: B-SYS: A 470-Processor Programmable Systolic Array. ICPP (1) 1991 : 580-583

Maya Gokhale , William Holmes , Andrew Kopser , Sara Lucas , Ronald Minnich , Douglas Sweely , Daniel P. Lopresti: Building and Using a Highly Parallel Programmable Logic Array. IEEE Computer 24 (1): 81-89 (1991)

Mark H. Nodine , Daniel P. Lopresti, Jeffrey Scott Vitter : I/O Overhead and Parallel VLSI Architectures for Lattice Computations. IEEE Trans. Computers 40 (7): 843-852 (1991)

Cheryl Harkness , Daniel P. Lopresti: VLSI Placement Using Uncertain Costs. ICCAD 1990 : 340-343

Mark H. Nodine , Daniel P. Lopresti, Jeffrey Scott Vitter : I/O Overhead and Parallel VLSI Architectures for Lattice Computations. ICCI 1990 : 497-506

Maya Gokhale , William Holmes , Andrew Kopser , Dick Kunze , Daniel P. Lopresti, Sara Lucas , Ronald Minnich , Peter Olsen : SPLASH: A Reconfigurable Linear Logic Array. ICPP (1) 1990 : 526-532

Richard J. Lipton , Daniel P. Lopresti: Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming. ICPP 1986 : 917-920

1 [ 9 ] [ 12 ]

2 [ 34 ] [ 36 ]

3 [ 12 ]

4 [ 16 ]

5 [ 2 ] [ 6 ]

6 [ 34 ]

7 [ 4 ]

8 [ 8 ]

9 [ 2 ] [ 6 ]

10 [ 25 ] [ 28 ] [ 31 ] [ 33 ]

11 [ 7 ]

12 [ 9 ]

13 [ 25 ] [ 28 ] [ 31 ] [ 33 ]

14 [ 2 ] [ 6 ]

15 [ 2 ]

16 [ 29 ]

17 [ 11 ]

18 [ 1 ]

19 [ 2 ] [ 6 ]

20 [ 16 ]

21 [ 2 ] [ 6 ]

22 [ 29 ]

23 [ 10 ] [ 11 ] [ 17 ] [ 20 ] [ 25 ] [ 27 ]

24 [ 3 ] [ 5 ]

25 [ 2 ]

26 [ 29 ]

27 [ 10 ] [ 17 ]

28 [ 29 ]

29 [ 6 ]

30 [ 11 ] [ 14 ]

31 [ 3 ] [ 5 ]

32 [ 16 ]

33 [ 18 ] [ 24 ] [ 25 ] [ 26 ] [ 28 ] [ 32 ]

34 [ 10 ] [ 15 ] [ 17 ] [ 21 ]




©2005 Association for Computing Machinery