Sciweavers

17789 search results - page 3426 / 3558
» Exceptional Use Cases
Sort
View
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
DIGRA
2003
Springer
15 years 9 months ago
Exploration in computer games - a new starting point
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
Simon Egenfeldt-Nielsen
EMMCVPR
2003
Springer
15 years 9 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
15 years 9 months ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
15 years 9 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck
« Prev « First page 3426 / 3558 Last » Next »