Sciweavers

25 search results - page 5 / 5
» The Complexity of Tree Transducer Output Languages
Sort
View
PLANX
2007
13 years 6 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
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...
Pierre Genevès, Nabil Layaïda, Alan Sc...
PODS
2010
ACM
242views Database» more  PODS 2010»
13 years 10 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
MT
2002
297views more  MT 2002»
13 years 4 months ago
MARS: A Statistical Semantic Parsing and Generation-Based Multilingual Automatic tRanslation System
We present MARS (Multilingual Automatic tRanslation System), a research prototype speech-to-speech translation system. MARS is aimed at two-way conversational spoken language trans...
Yuqing Gao, Bowen Zhou, Zijian Diao, Jeffrey S. So...
KBSE
2000
IEEE
13 years 8 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
RTAS
1997
IEEE
13 years 9 months ago
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
Sung-Whan Moon, Kang G. Shin, Jennifer Rexford