6740 search results - page 1038 / 1348 » An s -Hamiltonian Line Graph Problem |
306
click to vote
LACL
2011
Springer
14 years 9 months ago
2011
Springer
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
195
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
139
click to vote
FOCS
2003
IEEE
16 years 1 days ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
221
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
281
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...