2168 search results - page 42 / 434 » Randomized Algorithms and Complexity Theory |
109
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
110
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
118
click to vote
EUROCAST
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...
145
click to vote
FSTTCS
1991
Springer
15 years 6 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
130
Voted
IJCAI
2007
15 years 4 months ago
2007
Recommender systems are an emerging technology that helps consumers to find interesting products. A recommender system makes personalized product suggestions by extracting knowle...