default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn C. Handley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Jie Ning
, Volodymyr Babich, John C. Handley, Jussi Keppo:
Risk-Aversion and B2B Contracting Under Asymmetric Information: Evidence from Managed Print Services. Oper. Res. 66(2): 392-408 (2018)- 2017
- [i1]Lei Lin, John C. Handley, Adel W. Sadek:
Reliability and Sharpness in Border Crossing Traffic Interval Prediction. CoRR abs/1711.04848 (2017) - 2016
- [c17]Laura L. Tupper, David S. Matteson, John C. Handley:
Mixed data and classification of transit stops. IEEE BigData 2016: 2225-2232 - 2015
- [c16]Lina Fu, John C. Handley:
Measuring Realistic Transit Network Connectivity: A View with Travel Time Reliability. ITSC 2015: 2800-2805 - 2012
- [c15]Wencheng Wu, Beilei Xu, John C. Handley:
A method of detecting changes in image quality via sensing on customer documents. IQSP 2012: 82930P - 2010
- [c14]John C. Handley, Marie-Luise Schneider, Victor Ciriza, Jeffrey Earl:
Extreme Volume Detection for Managed Print Services. ICMLA 2010: 617-622
2000 – 2009
- 2009
- [r1]Eamonn J. Keogh, Li Keogh, John C. Handley:
Compression-Based Data Mining. Encyclopedia of Data Warehousing and Mining 2009: 278-285 - 2007
- [j13]Eamonn J. Keogh, Stefano Lonardi, Chotirat Ann Ratanamahatana, Li Wei, Sang-Hee Lee, John C. Handley:
Compression-based data mining of sequential data. Data Min. Knowl. Discov. 14(1): 99-129 (2007) - 2006
- [c13]Li Wei, John C. Handley, Nathaniel Martin, Tong Sun, Eamonn J. Keogh:
Clustering Workflow Requirements Using Compression Dissimilarity Measure. ICDM Workshops 2006: 50-54 - 2005
- [j12]John C. Handley:
Minimal-memory bit-vector architecture for computational mathematical morphology using subspace projections. IEEE Trans. Image Process. 14(8): 1088-1095 (2005) - [c12]John C. Handley, Anoop M. Namboodiri, Richard Zanibbi:
Document Understanding System Using Stochastic Context-Free Grammars. ICDAR 2005: 511-515 - 2004
- [j11]John C. Handley:
Computationally efficient approximate likelihood procedures for the Boolean model. Comput. Stat. Data Anal. 45(2): 125-136 (2004) - [c11]John C. Handley:
Minimal-memory bit vector architecture for computational mathematical morphology. Image Processing: Algorithms and Systems 2004: 159-167 - 2003
- [j10]John C. Handley:
Bit vector architecture for computational mathematical morphology. IEEE Trans. Image Process. 12(2): 153-158 (2003) - [c10]Karen M. Braun, John C. Handley:
A Comparison of Color Preferences of Adults and Children. PICS 2003: 402-407 - 2002
- [c9]Salil Prabhakar, Hui Cheng, Raja Bala, John C. Handley, Ying-wei Lin:
Detection and segmentation of sweeps in color graphics images. ICIP (3) 2002: 761-764 - [c8]Salil Prabhakar, Hui Cheng, John C. Handley, Zhigang Fan, Ying-wei Lin:
Picture-graphics color image classification. ICIP (2) 2002: 785-788 - 2001
- [j9]John C. Handley, John Bunge:
Guest Editorial: Special Section on Statistical Issue in Psychometric Assessment of Image Quality. J. Electronic Imaging 10(2): 374-375 (2001) - [j8]Brian A. Millen, John Bunge, John C. Handley:
Ranked data analysis of a gamut-mapping experiment. J. Electronic Imaging 10(2): 399-408 (2001) - [c7]John C. Handley:
Table analysis for multiline cell identification. Document Recognition and Retrieval 2001: 34-43 - [c6]John C. Handley:
Comparative Analysis of Bradley-Terry and Thurstone-Mosteller Paired Comparison Models for Image Quality Assessment. PICS 2001: 108-112
1990 – 1999
- 1999
- [j7]John C. Handley, Edward R. Dougherty:
Maximum-likelihood estimation and optimal filtering in the nondirectional, one-dimensional binomial germ-grain model. Pattern Recognit. 32(9): 1529-1541 (1999) - [j6]John C. Handley, Edward R. Dougherty:
Probability distributions for discrete one-dimensional coverage processes. Signal Process. 69(2): 163-168 (1999) - 1998
- [c5]John C. Handley:
Improving OCR accuracy through combination: a survey. SMC 1998: 4330-4333 - 1997
- [j5]John C. Handley, Edward R. Dougherty:
Maximum-Likelihood Estimation for the Two-Dimensional Discrete Boolean Random Set and Function Models Using Multidimensional Linear Samples. CVGIP Graph. Model. Image Process. 59(4): 221-231 (1997) - 1996
- [j4]John C. Handley, Edward R. Dougherty:
Optimal nonlinear filter for signal-union-noise and runlength analysis in the directional one-dimensional discrete Boolean random set model. Signal Process. 51(3): 147-166 (1996) - [c4]John C. Handley, Edward R. Dougherty:
Maximum-likelihood estimation for the two-dimensional discrete Boolean model using cross-windowed observations. Electronic Imaging: Nonlinear Image Processing 1996: 0000 - 1995
- [j3]Edward R. Dougherty, John C. Handley:
Recursive maximum-likelihood estimation in the one-dimensional discrete Boolean random set model. Signal Process. 43(1): 1-15 (1995) - 1994
- [j2]John C. Handley, Edward R. Dougherty:
Model-based optimal restoration of fax images in the context of mathematical morphology. J. Electronic Imaging 3(2): 182-189 (1994) - [c3]John C. Handley, Edward R. Dougherty:
Optimal nonlinear fax restoration. Document Recognition 1994: 232-242 - 1991
- [j1]John C. Handley:
Sampling by length. J. Am. Soc. Inf. Sci. 42(3): 229-232 (1991) - [c2]John C. Handley, Thomas B. Hickey:
Merging optical character recognition outputs for improved accuracy. RIAO 1991: 160-174
1980 – 1989
- 1986
- [c1]Thomas B. Hickey, John C. Handley:
Interactive Display of Text and Graphics on an IBM PC. Essen Symposium 1986: 137-149
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:15 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:
