20 search results - page 3 / 4 » A Characterization of the Layout Definition Problem for Web ... |
NIPS
2008
13 years 6 months ago
2008
Polysemy is a problem for methods that exploit image search engines to build object category models. Existing unsupervised approaches do not take word sense into consideration. We...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
We study in this paper the Web forum crawling problem, which is a very fundamental step in many Web applications, such as search engine and Web data mining. As a typical user-crea...
FLAIRS
2008
13 years 7 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
WSDM
2009
ACM
14 years 3 days ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
CIKM
2003
Springer
13 years 10 months ago
2003
Springer
Web pages (and resources, in general) can be characterized according to their geographical locality. For example, a web page with general information about wildflowers could be c...