Sciweavers

3235 search results - page 415 / 647
» Partial Redundant Modeling
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 11 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
MEDES
2010
ACM
14 years 11 months ago
Negotiating and delegating obligations
In this paper, we describe a security model where users are allowed to control their obligations partially or totally, depending on the security policy. The main motivation of our...
Meriam Ben-Ghorbel-Talbi, Frédéric C...
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 8 months ago
Doubly Robust Policy Evaluation and Learning
We study decision making in environments where the reward is only partially observed, but can be modeled as a function of an action and an observed context. This setting, known as...
Miroslav Dudík, John Langford, Lihong Li
ACL
2012
13 years 6 months ago
Incremental Joint Approach to Word Segmentation, POS Tagging, and Dependency Parsing in Chinese
We propose the first joint model for word segmentation, POS tagging, and dependency parsing for Chinese. Based on an extension of the incremental joint model for POS tagging and ...
Jun Hatori, Takuya Matsuzaki, Yusuke Miyao, Jun-ic...
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
13 years 6 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty