194 search results - page 33 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
99
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
122
Voted
AAAI
2012
13 years 2 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
103
Voted
SIAMJO
2008
15 years 11 days ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
PVLDB
2008
14 years 12 months ago
2008
A fundamental problem in information integration is to precisely specify the relationships, called mappings, between schemas. Designing mappings is a time-consuming process. To al...
141
click to vote
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...