3359 search results - page 117 / 672 » A Simplified Idea Algorithm |
105
click to vote
AAECC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
108
click to vote
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
170
click to vote
DAC
1994
ACM
15 years 6 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
132
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
136
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
We present in this paper an approach for XQuery optimization that exploits minimization opportunities raised in composition-style nesting of queries. More precisely, we consider t...