8486 search results - page 373 / 1698 » Ordered Enumeration Method |
127
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
136
click to vote
DOCENG
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
149
click to vote
CG
2004
Springer
15 years 11 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
158
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Multi-document summarization is a challenge to information overload problem to provide a condensed text for a number of documents. Most multi-document summarization systems make u...
145
click to vote
CAIP
2003
Springer
15 years 11 months ago
2003
Springer
The problem of independence and completeness of rotation moment invariants is addressed in this paper. General method for constructing invariants of arbitrary orders by means of co...