1225 search results - page 79 / 245 » Maximal Consistent Subsets |
ICPADS
2007
IEEE
14 years 2 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The approach of using ontology reasoning to cleanse the output of information extraction tools was first articulated in SemantiClean. A limiting factor in applying this ...
LAWEB
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents results of a case study that addresses many issues surrounding the difficult task of preservation in a digital library. We focus on a subset of these issues as...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
The purpose of this work is to develop a pattern recognition system simulating the human vision. A transparent neural network, with context returns is used. The context returns co...