Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng M...
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
Tatiana Tommasi, Francesco Orabona, Barbara Caputo
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...