Sciweavers

1369 search results - page 80 / 274
» Lattice computations for random numbers
Sort
View
SEFM
2007
IEEE
15 years 12 months ago
Hardness for Explicit State Software Model Checking Benchmarks
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
Neha Rungta, Eric G. Mercer
IPPS
2008
IEEE
15 years 12 months ago
Financial modeling on the cell broadband engine
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
Virat Agarwal, Lurng-Kuo Liu, David A. Bader
CEC
2008
IEEE
16 years 1 days ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
149
Voted
TMC
2008
127views more  TMC 2008»
15 years 5 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
EUROCRYPT
2009
Springer
16 years 6 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai