Sciweavers

1931 search results - page 380 / 387
» Why we blog
Sort
View
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
14 years 2 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
ECBS
1996
IEEE
93views Hardware» more  ECBS 1996»
14 years 2 months ago
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
Gérard Le Lann
VLDB
1997
ACM
126views Database» more  VLDB 1997»
14 years 1 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
CHI
1994
ACM
14 years 1 months ago
What HCI designers can learn from video game designers
Computer users have tasks they need to perform, and are therefore motivated to overcome poorly designed interfaces. With video games, there is no external motivation for the task ...
Randy Pausch, Rich Gold, Tim Skelly, David Thiel
FLOPS
2006
Springer
14 years 1 months ago
Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Peter Van Roy