Sciweavers

1071 search results - page 67 / 215
» An analysis framework for search sequences
Sort
View
PET
2010
Springer
14 years 1 months ago
How to Share Your Favourite Search Results while Preserving Privacy and Quality
Personalised social search is a promising avenue to increase the relevance of search engine results by making use of recommendations made by friends in a social network. More gener...
George Danezis, Tuomas Aura, Shuo Chen, Emre Kicim...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
13 years 21 days ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
IDA
2008
Springer
13 years 9 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
ARCS
2004
Springer
14 years 2 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang
BMCBI
2006
143views more  BMCBI 2006»
13 years 9 months ago
IsoSVM - Distinguishing isoforms and paralogs on the protein level
Background: Recent progress in cDNA and EST sequencing is yielding a deluge of sequence data. Like database search results and proteome databases, this data gives rise to inferred...
Michael Spitzer, Stefan Lorkowski, Paul Cullen, Al...