Sciweavers

2186 search results - page 173 / 438
» Considering an Organization's Memory
Sort
View
ICISC
2004
120views Cryptology» more  ICISC 2004»
15 years 8 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
CONCUR
2010
Springer
15 years 7 months ago
Information Flow in Interactive Systems
Abstract. We consider the problem of defining the information leakage in interactive systems where secrets and observables can alternate during the computation. We show that the in...
Mário S. Alvim, Miguel E. Andrés, Ca...
CGF
1999
86views more  CGF 1999»
15 years 6 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney
CORR
2011
Springer
161views Education» more  CORR 2011»
15 years 1 months ago
Generalized Gray Codes for Local Rank Modulation
—We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rankmodulation is...
Eyal En Gad, Michael Langberg, Moshe Schwartz, Jeh...
TIT
2010
99views Education» more  TIT 2010»
15 years 1 months ago
Capacity of Channels With Action-Dependent States
We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel state...
Tsachy Weissman