1963 search results - page 198 / 393 » The Maximum Solution Problem on Graphs |
113
click to vote
ACL
2009
15 years 1 months ago
2009
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
190
click to vote
JCO
2006
15 years 3 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
119
click to vote
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
120
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
129
click to vote
JAL
2006
15 years 3 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...