1382 search results - page 126 / 277 » Term ordering problem on MDG |
162
click to vote
COOPIS
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper addresses several problems associated with the specification of Web searches, and the retrieval, filtering, and rating of Web pages in order to improve the relevance, pr...
142
click to vote
WACC
1999
ACM
15 years 10 months ago
1999
ACM
a useful abstract representation is fundamental to solving many difficult problems in software engineering. In order to better understand how representations are actually used in ...
113
click to vote
LICS
1997
IEEE
15 years 9 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
140
Voted
AUSDM
2006
Springer
15 years 9 months ago
2006
Springer
Sequence mining is often conducted over static and temporal datasets as well as over collections of events (episodes). More recently, there has also been a focus on the mining of ...
186
click to vote
FOIKS
2008
Springer
15 years 7 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...