6274 search results - page 470 / 1255 » From query complexity to computational complexity |
248
Voted
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
154
click to vote
OWLED
2008
15 years 8 months ago
2008
OWL ontologies are complex computational artifacts that are intimately connected with conceptual information and with application issues that are not easily explicable in the conte...
167
click to vote
IPL
2007
15 years 6 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
299
click to vote
Publication
We present a new approach for activity modelling and anomaly detection based on non-parametric Gaussian Process (GP) models. Specifically, GP regression models are formulated to l...
166
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...