115 search results - page 11 / 23 » Rank 2 Types for Term Graph Rewriting |
SIGECOM
2004
ACM
14 years 27 days ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...