6274 search results - page 215 / 1255 » From query complexity to computational complexity |
140
click to vote
ICML
1999
IEEE
16 years 5 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
168
click to vote
SSPR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
180
click to vote
GAMEON
2003
15 years 6 months ago
2003
Simulation has been regarded as the third way to represent social models, alternative to other two symbol systems: the verbal argumentation and the mathematical one. Simulation ca...
180
click to vote
ECIR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
150
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...