2145 search results - page 363 / 429 » Answering Queries Using Views |
136
Voted
COMPGEOM
1998
ACM
15 years 6 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
115
Voted
AAAI
2008
15 years 5 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
125
Voted
UAI
1997
15 years 4 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
144
Voted
SODA
1990
ACM
15 years 3 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
151
Voted
ERCIMDL
2010
Springer
15 years 3 months ago
2010
Springer
A well-known challenge of information retrieval is how to infer a user's underlying information need when the input query consists of only a few keywords. Question Answering (...