7930 search results - page 1280 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
ISAAC
2007
Springer
16 years 5 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
140
click to vote
LION
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world c...
144
click to vote
SEMWEB
2007
Springer
16 years 4 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
139
click to vote
VLDB
2007
ACM
16 years 4 days ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
159
click to vote
WABI
2007
Springer
16 years 4 days ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...