2649 search results - page 253 / 530 » Argumentation for Decision Support |
179
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
171
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
209
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
207
click to vote
CAISE
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Even though SQL has become widely accepted as a language for implementing relational database schemas and querying data, there are cases where s experience the need for n...
227
Voted
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...