1813 search results - page 21 / 363 » Calculi of Approximation Spaces |
112
Voted
NIPS
2008
15 years 5 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
118
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
126
Voted
AAAI
2010
15 years 3 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
135
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
150
click to vote
JAT
2008
15 years 3 months ago
2008
Variable Hilbert scales are an important tool for the recent analysis of inverse problems in Hilbert spaces, as these constitute a way to describe smoothness of objects other than ...