Sciweavers

5995 search results - page 937 / 1199
» Algorithmic Game Theory
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 7 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
POPL
2008
ACM
16 years 5 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
PERCOM
2006
ACM
16 years 4 months ago
Context-Aware Resource Management in Multi-Inhabitant Smart Homes: A Nash H-Learning based Approach
A smart home aims at building intelligence automation with a goal to provide its inhabitants with maximum possible comfort, minimize the resource consumption and thus overall cost...
Nirmalya Roy, Abhishek Roy, Sajal K. Das
SSDBM
2009
IEEE
119views Database» more  SSDBM 2009»
15 years 11 months ago
Identifying the Most Endangered Objects from Spatial Datasets
Abstract. Real-life spatial objects are usually described by their geographic locations (e.g., longitude and latitude), and multiple quality attributes. Conventionally, spatial dat...
Hua Lu, Man Lung Yiu
FOCS
2008
IEEE
15 years 11 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...