Sciweavers

1024 search results - page 73 / 205
» Value complete, column complete, predicate complete
Sort
View
LREC
2010
132views Education» more  LREC 2010»
15 years 3 months ago
Hungarian Dependency Treebank
Herein, we present the process of developing the first Hungarian Dependency TreeBank. First, short references are made to dependency grammars we considered important in the develo...
Veronika Vincze, Dóra Szauter, Attila Alm&a...
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 1 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
ICST
2009
IEEE
14 years 11 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 8 months ago
A Logical Method for Policy Enforcement over Evolving Audit Logs
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
Deepak Garg, Limin Jia, Anupam Datta
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 7 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...