1679 search results - page 203 / 336 » Strong order equivalence |
PODS
2003
ACM
14 years 9 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
ALT
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
CHI
2010
ACM
14 years 3 months ago
2010
ACM
Electronic documents such as PDFs are becoming increasingly popular as we move further towards the notion of the paperless office. The harsh truth however is that e-documents diff...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....