1129 search results - page 61 / 226 » Modular Ranking Abstraction |
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
ESA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
AIRS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper investigates the effect of performance measures and relevance functions in comparing retrieval systems in INEX, an evaluation forum dedicated to XML retrieval....
TSP
2008
13 years 9 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...