621 search results - page 3 / 125 » Learning to Distribute Queries into Web Search Nodes |
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
INFOSCALE
2007
ACM
13 years 6 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
WWW
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we propose to model the blended search problem by assuming conditional dependencies among queries, VSEs and search results. The probability distributions of this mo...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engin...
ML
2007
ACM
13 years 4 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...