Sciweavers

1232 search results - page 117 / 247
» Digraphs: theory, algorithms and applications
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
EMSOFT
2005
Springer
14 years 2 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 1 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
ICS
2010
Tsinghua U.
14 years 1 months ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat
CCS
2007
ACM
14 years 3 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder