Sciweavers

6897 search results - page 85 / 1380
» Parallelization of Modular Algorithms
Sort
View
ASWC
2008
Springer
13 years 10 months ago
A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
Finding the justifications for an entailment (i.e., minimal sets of axioms responsible for it) is a prominent reasoning service in ontology engineering, as justifications facilitat...
Boontawee Suntisrivaraporn, Guilin Qi, Qiu Ji, Pet...
ACL
2012
11 years 11 months ago
BIUTEE: A Modular Open-Source System for Recognizing Textual Entailment
This paper introduces BIUTEE1 , an opensource system for recognizing textual entailment. Its main advantages are its ability to utilize various types of knowledge resources, and i...
Asher Stern, Ido Dagan
ASIACRYPT
2006
Springer
14 years 16 days ago
On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
Souradyuti Paul, Bart Preneel
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 8 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
EMSOFT
2009
Springer
14 years 20 days ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond