Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

William J. Sakoda

dblp:72/244 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorTheory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automata and formal languages · 92% Computational geometry · 8%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
finite automata
0.021978
Nondeterminism and the Size of Two Way Finite Automata · STOC 1978
On the Capability of Finite Automata in 2 and 3 Dimensional Space · FOCS 1977
Automata and formal languages › finite automata
two-way automata
0.011978
Nondeterminism and the Size of Two Way Finite Automata · STOC 1978
YearPublicationVenuePosition
1995 Matching graph embeddings for shape analysis
abstract
Past research in shape analysis and OCR has often emphasized graph matching techniques. We propose to use matching of graph embeddings because this is what is actually of interest. In this way we obtain faster and simpler algorithms since most decisions can be made on the basis of graph labels (the geometry of the embedding) rather than the topology of the graph. The latter has to examined only in very few cases. The proposed algorithm consists of four sieves that compare branches of two embeddings by (normalized), angle, y-position, x-position, and length. Pairs of graphs that pass all the sieves have a node correspondence established so the next step compares degrees. Finally paths are determined using Kleene's algorithm and compared with prototype arcs.
Theodosios Pavlidis, William J. Sakoda, H. Shi
ICDAR2
1993 Refinement and testing of a character recognition system based on feature extraction in grayscale space
abstract
A method for recognizing degraded text is described. One application domain is postal address blocks, where the system must function with varying and unspecified fonts, dot matrix printing, and poor print quality. The design achieves tolerance to differing contrast and degraded print via gray-scale analysis, and omnifont capability and good performance on touching and broken characters by encoding character shapes as graphs. Experimental results on address blocks supplied by the US Postal Service are presented. Experiments on subsampling the data indicate that the performance at 100 dpi is very close to that of the original 300 dpi.>
William J. Sakoda, Jiangying Zhou, Theodosios Pavlidis
ICDAR1
1978 Nondeterminism and the Size of Two Way Finite Automata
abstract
Article Free Access Share on Nondeterminism and the size of two way finite automata Authors: William J. Sakoda View Profile , Michael Sipser View Profile Authors Info & Claims STOC '78: Proceedings of the tenth annual ACM symposium on Theory of computingMay 1978 Pages 275–286https://doi.org/10.1145/800133.804357Online:01 May 1978Publication History 129citation98DownloadsMetricsTotal Citations129Total Downloads98Last 12 Months33Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
William J. Sakoda, Michael Sipser
STOC1
1977 On the Capability of Finite Automata in 2 and 3 Dimensional Space
Manuel Blum 0001, William J. Sakoda
FOCS2