Sciweavers

1936 search results - page 359 / 388
» Challenges in Web Search Engines
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 3 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
DL
1998
Springer
111views Digital Library» more  DL 1998»
15 years 1 months ago
SONIA: A Service for Organizing Networked Information Autonomously
The recent explosion of on-line information in Digital Libraries and on the World Wide Web has given rise to a number of query-based search engines and manually constructed topica...
Mehran Sahami, Salim Yusufali, Michelle Q. Wang Ba...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
15 years 10 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
SIGCSE
2006
ACM
127views Education» more  SIGCSE 2006»
15 years 3 months ago
SNITCH: a software tool for detecting cut and paste plagiarism
Plagiarism of material from the Internet is a widespread and growing problem. Computer science students, and those in other science and engineering courses, can sometimes get away...
Sebastian Niezgoda, Thomas P. Way
SPIRE
2005
Springer
15 years 3 months ago
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
Paolo Boldi, Sebastiano Vigna