903 search results - page 89 / 181 » Non-well-founded trees in categories |
273
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
169
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
145
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless c...
150
click to vote
TLCA
2009
Springer
16 years 25 days ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
194
click to vote
MIR
2006
ACM
16 years 7 days ago
2006
ACM
Scalable approaches to video content classification are limited by an inability to automatically generate representations of events ode abstract temporal structure. This paper pre...