Sciweavers

8125 search results - page 1461 / 1625
» Parallelism and evolutionary algorithms
Sort
View
EGH
2011
Springer
14 years 3 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
141
Voted
IACR
2011
136views more  IACR 2011»
14 years 3 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
CVPR
2012
IEEE
13 years 6 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
SPAA
2004
ACM
15 years 9 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
126
Voted
PODC
2010
ACM
15 years 8 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
« Prev « First page 1461 / 1625 Last » Next »