1486 search results - page 56 / 298 » Algorithms for two-box covering |
92
Voted
WIA
2004
Springer
15 years 6 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
93
Voted
EKAW
2006
Springer
15 years 4 months ago
2006
Springer
Robust mechanisms for ontology selection are crucial for the evolving Semantic Web characterized by rapidly increasing numbers of online ontologies and by applications that automat...
113
click to vote
AICCSA
2007
IEEE
15 years 7 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
109
click to vote
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
136
click to vote
FSTTCS
2003
Springer
15 years 6 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...