6274 search results - page 229 / 1255 » From query complexity to computational complexity |
140
click to vote
ICDT
1995
ACM
15 years 8 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
110
click to vote
FEGC
2008
15 years 6 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
145
click to vote
ACL
2010
15 years 2 months ago
2010
Building an accurate Named Entity Recognition (NER) system for languages with complex morphology is a challenging task. In this paper, we present research that explores the featur...
123
click to vote
EXPCS
2007
15 years 8 months ago
2007
The modeling of power and thermal behavior of processors requires challenging validation processes, which may be complex and undependable. In order to ameliorate some of the diffi...
160
click to vote
DEBS
2009
ACM
15 years 11 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...