5316 search results - page 309 / 1064 » Which Search Problems Are Random |
163
click to vote
AAAI
2006
15 years 7 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
192
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
167
click to vote
PKC
1999
Springer
15 years 10 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
230
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
206
click to vote
PKC
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...