Sciweavers

720 search results - page 60 / 144
» Gossiping personalized queries
Sort
View
AI
2010
Springer
15 years 1 days ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
DOLAP
2010
ACM
14 years 10 months ago
Towards OLAP query reformulation in peer-to-peer data warehousing
Inter-business collaborative contexts prefigure a distributed scenario where companies organize and coordinate themselves to develop common and shared opportunities. Traditional b...
Matteo Golfarelli, Federica Mandreoli, Wilma Penzo...
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 9 days ago
Spotting out emerging artists using geo-aware analysis of P2P query strings
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel
SIGIR
2009
ACM
15 years 6 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
CIKM
2001
Springer
15 years 4 months ago
X007: Applying 007 Benchmark to XML Query Processing Tool
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
Stéphane Bressan, Gillian Dobbie, Zoé...