Sciweavers

14699 search results - page 2606 / 2940
» Complexity and Cognitive Computing
Sort
View
TOG
2012
224views Communications» more  TOG 2012»
13 years 8 months ago
Lagrangian vortex sheets for animating fluids
Buoyant turbulent smoke plumes with a sharp smoke-air interface, such as volcanic plumes, are notoriously hard to simulate. The surface clearly shows small-scale turbulent structu...
Tobias Pfaff, Nils Thürey, Markus H. Gross
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 8 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
ACNS
2009
Springer
193views Cryptology» more  ACNS 2009»
16 years 22 days ago
Cryptanalysis of Twister
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
Florian Mendel, Christian Rechberger, Martin Schl&...
163
Voted
FOCS
2008
IEEE
16 years 18 days ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
PODC
2009
ACM
16 years 6 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
« Prev « First page 2606 / 2940 Last » Next »