Sciweavers

6829 search results - page 1007 / 1366
» Quantitative Generalizations of Languages
Sort
View
ANLP
1992
137views more  ANLP 1992»
15 years 8 months ago
Compound Nouns in a Unification-Based MT System
This paper describes an approach to the treatment of nominal compounds in a machine translation project employing a modern unification-based system. General problems connected wit...
Pierrette Bouillon, Katharina Boesefeldt, Graham R...
CCS
2010
ACM
15 years 7 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
AMAI
2006
Springer
15 years 6 months ago
An algebraic framework for temporal attribute characteristics
Most real-world database applications manage temporal data, i.e., data with associated time references that capture a temporal aspect of the data, typically either when the data i...
Michael H. Böhlen, Johann Gamper, Christian S...
JAIR
2006
90views more  JAIR 2006»
15 years 6 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
JLP
2006
155views more  JLP 2006»
15 years 6 months ago
A formally grounded software specification method
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
Christine Choppy, Gianna Reggio
« Prev « First page 1007 / 1366 Last » Next »