Sciweavers

3809 search results - page 606 / 762
» Associative language descriptions
Sort
View
180
Voted
LICS
2009
IEEE
16 years 1 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
CIE
2009
Springer
16 years 1 months ago
Equivalence Relations on Classes of Computable Structures
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
Ekaterina B. Fokina, Sy-David Friedman
RR
2009
Springer
16 years 1 months ago
Distributed Resolution for Expressive Ontology Networks
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
Anne Schlicht, Heiner Stuckenschmidt
SAT
2009
Springer
126views Hardware» more  SAT 2009»
16 years 1 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
172
Voted
DOCENG
2009
ACM
16 years 1 months ago
Declarative interfaces for dynamic widgets communications
Widgets are small and focused multimedia applications that can be found on desktop computers, mobile devices or even TV sets. Widgets rely on structured documents to describe thei...
Cyril Concolato, Jean Le Feuvre, Jean-Claude Dufou...