2485 search results - page 63 / 497 » Time Bounded Frequency Computations |
135
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
128
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
112
click to vote
DAM
2006
15 years 4 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
139
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
123
click to vote
ESORICS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret informati...