1225 search results - page 79 / 245 » Maximal Consistent Subsets |
194
click to vote
ICPADS
2007
IEEE
16 years 15 days 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...
131
click to vote
CPAIOR
2007
Springer
16 years 10 days 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...
148
click to vote
SEMWEB
2007
Springer
16 years 9 days 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 ...
147
click to vote
LAWEB
2006
IEEE
16 years 6 days 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...
163
click to vote
ICDAR
2005
IEEE
15 years 11 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...