1127 search results - page 17 / 226 » Testing the Expansion of a Graph |
ACL
2006
14 years 10 days ago
2006
We report on the development of a new automatic feedback model to improve information retrieval in digital libraries. Our hypothesis is that some particular sentences, selected ba...
EVOW
2008
Springer
14 years 21 days ago
2008
Springer
Nowadays, searching information in the web or in any kind of document collection has become one of the most frequent activities. However, user queries can be formulated in a way th...
EMNLP
2008
14 years 11 days ago
2008
This paper explores the use of set expansion (SE) to improve question answering (QA) when the expected answer is a list of entities belonging to a certain class. Given a small set...
NIPS
2000
14 years 8 days ago
2000
Recent work has exploited boundedness of data in the unsupervised learning of new types of generative model. For nonnegative data it was recently shown that the maximum-entropy ge...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...