Demo Data from SIGIR 2026 / reviewers in the wild / expert
T. J. Richardson
dblp:43/3611
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorTheory of computation · 2Artificial intelligence and machine learning · 1
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.
| Artificial intelligence
1 paper |
Learning theory · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › computational learning theory
learnability |
0.0 | 1 | 1994 | A metric entropy bound is not sufficient for learnability · IEEE Trans. Inf. Theory 1994 |
Machine learning › Learning theory
metric entropy |
0.0 | 1 | 1994 | A metric entropy bound is not sufficient for learnability · IEEE Trans. Inf. Theory 1994 |
Machine learning › Learning theory
PAC learning |
0.0 | 1 | 1994 | A metric entropy bound is not sufficient for learnability · IEEE Trans. Inf. Theory 1994 |
Computational geometry › digital geometry
digital curves |
0.0 | 1 | 1994 | Local Versus Nonlocal Computation of Length of Digitized Curves · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Image and video processing
image segmentation |
0.0 | 1 | 1994 | Local Versus Nonlocal Computation of Length of Digitized Curves · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Methods — techniques the papers use, named apart from their topics
parallel computation · 0.0digitization model · 0.0counterexample construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Approximation of Planar Convex Sets from Hyperplane Probes
T. J. Richardson |
Discret. Comput. Geom. | 1 |
| 1996 | Planar Rectifiable Curves Are Determined by Their. Projections
T. J. Richardson |
Discret. Comput. Geom. | 1 |
| 1994 | Local Versus Nonlocal Computation of Length of Digitized CurvesabstractConsiders the problem of computing the length of a curve from digitized versions of the curve using parallel computation. The authors' aim is to study the inherent parallel computational complexity of this problem as a function of the digitization level. Precise formulations for the digitization, the parallel computation, and notions of local and nonlocal computations are given. It is shown that length cannot be computed locally from digitizations on rectangular tessellations. However, for a random tessellation and appropriate deterministic ones, the authors show that the length of straight line segments can be computed locally. Implications of the authors' results for a method for image segmentation and a number of open problems are discussed.> Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis |
IEEE Trans. Pattern Anal. Mach. Intell. | 3 |
| 1994 | A metric entropy bound is not sufficient for learnabilityabstractThe authors prove by means of a counterexample that it is not sufficient, for probably approximately correct (PAC) learning under a class of distributions, to have a uniform bound on the metric entropy of the class of concepts to be learned. This settles a conjecture of Benedek and Itai (1991).> Richard M. Dudley, Sanjeev R. Kulkarni, T. J. Richardson, Ofer Zeitouni |
IEEE Trans. Inf. Theory | 3 |
| 1993 | Local Versus Non-local Computation of Length of Digitized Curves
Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis |
FSTTCS | 3 |