5316 search results - page 302 / 1064 » Which Search Problems Are Random |
179
click to vote
SIAMDM
2010
15 years 26 days ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
163
click to vote
WWW
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we present a novel solution to the image annotation problem which annotates images using search and data mining technologies. An accurate keyword is required to ini...
161
Voted
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
136
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
142
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...