Sciweavers

2944 search results - page 53 / 589
» Robust Semantic Construction
Sort
View
134
Voted
ICFP
2007
ACM
16 years 3 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
160
Voted
BMCBI
2008
121views more  BMCBI 2008»
15 years 3 months ago
OntoDas - a tool for facilitating the construction of complex queries to the Gene Ontology
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...
Kieran O'Neill, Alexander García Castro, An...
HIPS
1998
IEEE
15 years 7 months ago
Constructive and Adaptable Distributed Shared Memory
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system ...
Jordi Bataller, José M. Bernabéu-Aub...
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
15 years 5 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman
111
Voted
TIME
2002
IEEE
15 years 8 months ago
A Finite-State Approach to Event Semantics
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
Tim Fernando