Sciweavers

738 search results - page 105 / 148
» cases 2001
Sort
View
62
Voted
HPCA
2001
IEEE
15 years 10 months ago
Differential FCM: Increasing Value Prediction Accuracy by Improving Table Usage Efficiency
Value prediction is a relatively new technique to increase the Instruction Level Parallelism (ILP) in future microprocessors. An important problem when designing a value predictor...
Bart Goeman, Hans Vandierendonck, Koenraad De Boss...
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
15 years 10 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
73
Voted
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
15 years 10 months ago
Private approximation of NP-hard functions
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz,...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
15 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh