719 search results - page 70 / 144 » Adaptive Online Time Allocation to Search Algorithms |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
In many cases, rather than a keyword search, people intend to see what is going on through the Internet. Then the integrated comprehensive information on news topics is necessary,...
155
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
CHI
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we present a case study of humaninformation interaction in the online realm of politics. The case study consists of a participant observed while searching and brows...
ICTAI
1992
IEEE
15 years 1 months ago
1992
IEEE
This paper presents a method for tuning parameters under a fixed time constraint for a general binocular stereo-vision algorithm. A major difficulty in stereo vision, as well as i...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...