Sciweavers

756 search results - page 129 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
SCIE
1997
Springer
14 years 11 days ago
Semantic Matching: Formal Ontological Distinctions for Information Organization, Extraction, and Integration
Abstract. The task of information extraction can be seen as a problem of semantic matching between a user-defined template and a piece of information written in natural language. T...
Nicola Guarino
ATAL
2003
Springer
14 years 1 months ago
Authoring scenes for adaptive, interactive performances
In this paper, we introduce a toolkit called SceneMaker for authoring scenes for adaptive, interactive performances. These performances are based on automatically generated and pr...
Patrick Gebhard, Michael Kipp, Martin Klesen, Thom...
PLDI
2006
ACM
14 years 2 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
CEC
2007
IEEE
14 years 2 months ago
A Utile Function Optimizer
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
Christopher K. Monson, Kevin D. Seppi, James L. Ca...
DNA
2007
Springer
159views Bioinformatics» more  DNA 2007»
14 years 2 months ago
Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
Urmi Majumder, Thomas H. LaBean, John H. Reif