Sciweavers

756 search results - page 107 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
CASSIS
2004
Springer
14 years 1 months ago
History-Based Access Control and Secure Information Flow
Abstract. This paper addresses the problem of static checking of programs to ensure that they satisfy confidentiality policies in the presence of dynamic access control in the for...
Anindya Banerjee, David A. Naumann
FOSSACS
2012
Springer
12 years 3 months ago
A Coalgebraic Perspective on Minimization and Determinization
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
Jirí Adámek, Filippo Bonchi, Mathias...
CIE
2008
Springer
13 years 10 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
ICDT
1999
ACM
133views Database» more  ICDT 1999»
14 years 13 days ago
A Framework for the Investigation of Aggregate Functions in Database Queries
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
Luca Cabibbo, Riccardo Torlone