Sciweavers

4131 search results - page 361 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
WWW
2005
ACM
16 years 5 months ago
Focused crawling by exploiting anchor text using decision tree
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...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
SIGMOD
2009
ACM
147views Database» more  SIGMOD 2009»
16 years 5 months ago
XML keyword query refinement
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...
ICS
2010
Tsinghua U.
16 years 2 months ago
Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions
: 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...
Brendan Lucier
CVPR
2010
IEEE
16 years 1 months ago
Safety in Numbers: Learning Categories from Few Examples with Multi Model Knowledge Transfer
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
LICS
2008
IEEE
15 years 11 months ago
Context Matching for Compressed Terms
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 ...
Adria Gascón, Guillem Godoy, Manfred Schmid...