Sciweavers

822 search results - page 10 / 165
» Descendants in Increasing Trees
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 1 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman
IKE
2003
14 years 11 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
15 years 11 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
ECOOP
2005
Springer
15 years 3 months ago
Expressive Pointcuts for Increased Modularity
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...
Klaus Ostermann, Mira Mezini, Christoph Bockisch
IJCAI
2003
14 years 11 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal