1101 search results - page 49 / 221 » An Algorithm for the Graph Crossing Number Problem |
112
click to vote
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
136
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
111
click to vote
ICWS
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
110
click to vote
NAACL
2007
15 years 3 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
110
click to vote
COLT
1999
Springer
15 years 6 months ago
1999
Springer
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...