Samidh Chatterjee

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:81/4961 · DBLP profile ↗

← Back

4ranked-venue papers

3as first author

0since 2021 · last 2011

—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorTheory of computation · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence

1 paper

Machine translation · 50% Optimization for machine learning · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Machine learning › Optimization for machine learning › training criteria minimum error rate training	0.1	1	2010	Minimum Error Rate Training by Sampling the Translation Lattice · EMNLP 2010
Natural language and speech › Machine translation statistical machine translation	0.1	1	2010	Minimum Error Rate Training by Sampling the Translation Lattice · EMNLP 2010

Methods — techniques the papers use, named apart from their topics

sampling from translation lattice · 0.1

Year	Publication	Venue	Position
2011	Instant approximate 1-center on road networks via embeddings abstract We study the 1-center problem on road networks, an important problem in GIS. Using Euclidean embeddings, and reduction to fast nearest neighbor search, we devise an approximation algorithm for this problem. Our initial experiments on real world data sets indicate fast computation of constant factor approximate solutions for query sets much larger than previously computable using exact techniques. Samidh Chatterjee, Bradley Neff	GIS	1
2010	Minimum Error Rate Training by Sampling the Translation Lattice Samidh Chatterjee, Nicola Cancedda	EMNLP	1
2010	Geometric Minimum Spanning Trees with GeoFilterKruskal Samidh Chatterjee, Michael Connor	SEA	1
2006	On the All-Farthest-Segments problem for a planar set of points Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere	Inf. Process. Lett.	2