2981 search results - page 247 / 597 » Answer Set Planning |
175
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...
188
click to vote
DOCENG
2009
ACM
16 years 1 months ago
2009
ACM
In order to evaluate the performance of information retrieval and extraction algorithms, we need test collections. A test collection consists of a set of documents, a clearly form...
161
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
Considering the available body of literature on continuous EDAs, one must state that many important questions are still unanswered, e.g.: How do continuous EDAs really work, and h...
176
click to vote
MICAI
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
188
click to vote
VLDB
2005
ACM
16 years 3 days ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...