10 search results - page 2 / 2 » iandc 2011 |
IANDC
2011
12 years 12 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
IANDC
2011
12 years 12 months ago
2011
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
IANDC
2011
12 years 12 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
IANDC
2011
12 years 12 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
IANDC
2011
12 years 12 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...