10182 search results - page 1658 / 2037 » Case Studies |
165
click to vote
ICDT
2005
ACM
16 years 14 days ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
181
click to vote
ICN
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
177
click to vote
IMA
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
152
click to vote
ISAAC
2005
Springer
16 years 13 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
190
click to vote
ISAAC
2005
Springer
16 years 13 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...