1232 search results - page 117 / 247 » Digraphs: theory, algorithms and applications |
190
click to vote
FOCS
2008
IEEE
16 years 14 days ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
176
click to vote
EMSOFT
2005
Springer
15 years 11 months ago
2005
Springer
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...
186
click to vote
ICDE
2011
IEEE
14 years 9 months ago
2011
IEEE
— 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...
181
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: 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...
166
click to vote
CCS
2007
ACM
16 years 5 days ago
2007
ACM
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 ...