Sciweavers

154 search results - page 15 / 31
» Equivalence Problems for Circuits over Sets of Natural Numbe...
Sort
View
JELIA
2004
Springer
15 years 5 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
MST
2010
140views more  MST 2010»
14 years 10 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
PODS
2007
ACM
203views Database» more  PODS 2007»
15 years 11 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
CCS
2006
ACM
15 years 3 months ago
Searchable symmetric encryption: improved definitions and efficient constructions
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail ...
EDCC
1994
Springer
15 years 3 months ago
RIFLE: A General Purpose Pin-level Fault Injector
This paper discusses the problems of pin-level fault injection for dependability validation and presents the architecture of a pin-level fault injector called RIFLE. This system ca...
Henrique Madeira, Mário Zenha Rela, Francis...