501 search results - page 38 / 101 » Problems with the use of web search engines to find results ... |
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
CHI
2008
ACM
14 years 8 months ago
2008
ACM
Current user interfaces for Web search, including browsers and search engine sites, typically treat search as a transient activity. However, people often conduct complex, multique...
VL
2010
IEEE
13 years 6 months ago
2010
IEEE
-- In the past decade there has been spectacular growth in the number and size of third-party libraries, frameworks, toolkits and other Application Programming Interfaces (APIs) av...
ICDE
2008
IEEE
15 years 7 months ago
2008
IEEE
The Web has the potential to become the world’s
largest knowledge base. In order to unleash this potential,
the wealth of information available on the Web needs to be
extracte...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...