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.

Eric W. Brown 0001

dblp:b/EricWBrown1 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2012
—ORCID · none

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

Databases, data management, data science and information retrieval · 9 · 5 first-authorArtificial intelligence and machine learning · 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.

Artificial intelligence
1 paper
Question answering and dialogue systems · 100%
Databases, data mining, and information retrieval
4 papers
Information retrieval · 79% Data models and query languages · 11% Query processing and optimization · 11%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems
open-domain question answering
0.112012
Watson: the Jeopardy! challenge and beyond · SIGIR 2012
Information retrieval › question answering
answer selection
0.012000
Question-answering by predictive annotation · SIGIR 2000
Information retrieval › document retrieval
passage retrieval
0.012000
Question-answering by predictive annotation · SIGIR 2000
Information retrieval
question answering
0.012000
Question-answering by predictive annotation · SIGIR 2000
Query processing and optimization
query optimization
0.011995
Fast Evaluation of Structured Queries for Information Retrieval · SIGIR 1995
Data models and query languages
structured query
0.011995
Fast Evaluation of Structured Queries for Information Retrieval · SIGIR 1995
Information retrieval › indexing › text indexing
full-text indexing
0.011994
Fast Incremental Indexing for Full-Text Information Retrieval · VLDB 1994
Programming languages and type systems
persistent programming languages
0.011993
Update Logging for Persistent Programming Languages: A Comparative Performance Evaluation · VLDB 1993
Information retrieval › retrieval models › probabilistic retrieval model
inference network model
0.011995
Fast Evaluation of Structured Queries for Information Retrieval · SIGIR 1995

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

DeepQA · 0.3passage-level ranking · 0.0indexing · 0.0annotation · 0.0incremental indexing · 0.0
YearPublicationVenuePosition
2012 Watson: the Jeopardy! challenge and beyond
abstract
Watson, named after IBM founder Thomas J. Watson, was built by a team of IBM researchers who set out to accomplish a grand challenge-build a computing system that rivals a human's ability to answer questions posed in natural language with speed, accuracy and confidence. The quiz show Jeopardy! provided the ultimate test of this technology because the game's clues involve analyzing subtle meaning, irony, riddles and other complexities of natural language in which humans excel and computers traditionally fail. Watson passed its first test on Jeopardy!, beating the show's two greatest champions in a televised exhibition match, but the real test will be in applying the underlying natural language processing and analytics technology in business and across industries. In this talk I will introduce the Jeopardy! grand challenge, present an overview of Watson and the DeepQA technology upon which Watson is built, and explore future applications of this technology.
Eric W. Brown 0001
SIGIR1
2006 Automatic search from streaming data
Anni Coden, Eric W. Brown 0001
Inf. Retr.2
2002 Detecting similar documents using salient terms
abstract
We describe a system for rapidly determining document similarity among a set of documents obtained from an information retrieval (IR) system. We obtain a ranked list of the most important terms in each document using a rapid phrase recognizer system. We store these in a database and compute document similarity using a simple database query. If the number of terms found to not be contained in both documents is less than some predetermined threshold compared to the total number of terms in the document, these documents are determined to be very similar. We compare this to the shingles approach.
James W. Cooper, Anni Coden, Eric W. Brown 0001
CIKM3
2001 Towards Speech as a Knowledge Resource
abstract
Speech is a tantalizing mode of human communication. On the one hand, humans understand speech with ease and use speech to express complex ideas, information, and knowledge. On the other hand, automatic speech recognition with computers is still very hard, and extracting knowledge from speech is even harder. In this paper we motivate the study of speech as a knowledge resource and briefly survey a family of related applications and systems being developed at IBM Research aimed towards the goal of exploiting speech as a knowledge resource.
Eric W. Brown 0001, Savitha Srinivasan, Anni Coden, Dulce B. Ponceleon, James W. Cooper, Arnon Amir, Jan Pieper
CIKM1
2000 Question-answering by predictive annotation
abstract
We present a new technique for question answering called Predictive Annotation. Predictive Annotation identifies potential answers to questions in text, annotates them accordingly and indexes them. This technique, along with a complementary analysis of questions, passage-level ranking and answer selection, produces a system effective at answering natural-language fact-seeking questions posed against large document collections. Experimental results show the effects of different parameter settings and lead to a number of general observations about the question-answering problem.
John M. Prager, Eric W. Brown 0001, Anni Coden, Dragomir R. Radev
SIGIR2
1995 Fast Evaluation of Structured Queries for Information Retrieval
abstract
Information retrieval systems are being challenged to manage larger and larger document collections. In an effort to provide better retrieval performance on large collections, more sophisticated retrieval techniques have been developed that support rich, structured queries. Structured queries are not amenable to previously proposed optimization techniques. Optimizing execution, however, is even more important in the context of large document collections. We present a new structured query optimization technique which we have implemented in an inference network-based information retrieval system. Experimental results show that query evaluation time can be reduced by more than half with little impact on retrieval effectiveness.
Eric W. Brown 0001
SIGIR1
1994 Supporting Full-Text Information Retrieval with a Persistent Object Store
Eric W. Brown 0001, Jamie Callan, W. Bruce Croft, J. Eliot B. Moss
EDBT1
1994 Fast Incremental Indexing for Full-Text Information Retrieval
Eric W. Brown 0001, Jamie Callan, W. Bruce Croft
VLDB1
1993 Update Logging for Persistent Programming Languages: A Comparative Performance Evaluation
Antony L. Hosking, Eric W. Brown 0001, J. Eliot B. Moss
VLDB2