1650 search results - page 152 / 330 » The HOM problem is decidable |
154
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
144
click to vote
ICFEM
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
151
click to vote
FUIN
2010
14 years 11 months ago
2010
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
211
click to vote
VEE
2012
ACM
13 years 12 months ago
2012
ACM
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...
131
click to vote
FOIKS
2008
Springer
15 years 6 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...