14739 search results - page 251 / 2948 » An optimization problem on the sphere |
ISAAC
2003
Springer
15 years 4 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
107
click to vote
COCOON
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
STOC
1987
ACM
15 years 2 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
APWEB
2010
Springer
15 years 2 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....