186 search results - page 13 / 38 » Speeding up algorithms on compressed web graphs |
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
WISE
2000
Springer
13 years 12 months ago
2000
Springer
In this paper we report our research on building WebSail { an intelligent web search engine that is able to perform real-time adaptive learning. WebSail learns from the user'...
SSD
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
CAEPIA
2007
Springer
13 years 11 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
WEBI
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...