1092 search results - page 13 / 219 » Do summaries help |
174
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
180
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
Social media services have spread throughout the world in just a few years. They have become not only a new source of information, but also new mechanisms for societies world-wide...
160
click to vote
TSD
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
152
click to vote
IUI
2003
ACM
15 years 10 months ago
2003
ACM
How do we know if we can afford a particular purchase? We can find out what the payments might be and check our balances on various accounts, but does this answer the question? Wh...
195
click to vote
DBPL
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In the context of XML data management systems, the estimation of query cardinality is becoming more and more important: the information provided by a query result estimat...