Sciweavers

4139 search results - page 592 / 828
» Designing and Implementing Combinator Languages
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
15 years 4 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
WWW
2008
ACM
16 years 5 months ago
Querying for meta knowledge
The Semantic Web is based on accessing and reusing RDF data from many different sources, which one may assign different levels of authority and credibility. Existing Semantic Web ...
Bernhard Schueler, Sergej Sizov, Steffen Staab, Du...
SAS
2009
Springer
204views Formal Methods» more  SAS 2009»
16 years 5 months ago
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
Kyung-Goo Doh, Hyunha Kim, David A. Schmidt
CHI
2004
ACM
16 years 4 months ago
A commonsense approach to predictive text entry
People cannot type as fast as they think, especially when faced with the constraints of mobile devices. There have been numerous approaches to solving this problem, including rese...
Tom Stocky, Alexander Faaborg, Henry Lieberman
SIGMOD
2005
ACM
197views Database» more  SIGMOD 2005»
16 years 4 months ago
Schema and ontology matching with COMA++
We demonstrate the schema and ontology matching tool COMA++. It extends our previous prototype COMA utilizing a composite approach to combine different match algorithms [3]. COMA+...
David Aumueller, Hong Hai Do, Sabine Massmann, Erh...