Sciweavers

234 search results - page 26 / 47
» Clustering e-commerce search engines
Sort
View
WEBI
2010
Springer
13 years 5 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet
PDP
2008
IEEE
14 years 1 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
IPM
2007
156views more  IPM 2007»
13 years 7 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...
ICSM
2007
IEEE
14 years 1 months ago
A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search
Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolu...
Jeremy S. Archuleta, Eli Tilevich, Wu-chun Feng
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 8 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, ...