5316 search results - page 154 / 1064 » Which Search Problems Are Random |
132
Voted
ALGORITHMICA
1998
15 years 3 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
126
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
126
Voted
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
122
Voted
PKC
2004
Springer
15 years 9 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
126
Voted
ISSTA
2006
ACM
15 years 9 months ago
2006
ACM
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...