Sciweavers

6978 search results - page 1136 / 1396
» On Proofs in System P
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 10 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
FSTTCS
2006
Springer
15 years 10 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
ACSAC
2001
IEEE
15 years 10 months ago
Verifiable Identifiers in Middleware Security
fies a number of issues related to security information r semantics on different layers of abstraction. In particular it is difficult to express caller and target accurately in the...
Ulrich Lang, Dieter Gollmann, Rudolf Schreiner
SIGUCCS
2000
ACM
15 years 10 months ago
Approaches to Computer Lab Management: Lockdown vs. Freedom
Basic approaches to computer lab management range along a spectrum from total lockdown of lab computers to total freedom. Total lockdown, which can be implemented with system perm...
Christopher Jones, Yasemin Tunc, Deborah Cherry
« Prev « First page 1136 / 1396 Last » Next »