Sciweavers

376 search results - page 63 / 76
» Search Strategies for Keyword-based Queries
Sort
View
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 11 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 9 months ago
Schema Mapping in P2P Networks Based on Classification and Probing
In this paper, we address the problems of adaptive schema mappings between different peers in peer-to-peer network and searching for interesting data residing at different peers ba...
Guoliang Li, Beng Chin Ooi, Bei Yu, Lizhu Zhou
SIGIR
2011
ACM
14 years 8 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
EXPDB
2006
ACM
15 years 11 months ago
A Reproducible Benchmark for P2P Retrieval
With the growing popularity of information retrieval (IR) in distributed systems and in particular P2P Web search, a huge number of protocols and prototypes have been introduced i...
Thomas Neumann, Matthias Bender, Sebastian Michel,...
WWW
2009
ACM
16 years 6 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...