179 search results - page 34 / 36 » Fixed-Point Query Languages for Linear Constraint Databases |
PPDP
2007
Springer
14 years 4 days ago
2007
Springer
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
PLANX
2007
13 years 7 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
PODS
1994
ACM
13 years 10 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
DEXA
2009
Springer
14 years 17 days ago
2009
Springer
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
CIVR
2007
Springer
14 years 5 days ago
2007
Springer
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...