Sciweavers

6129 search results - page 1064 / 1226
» A parallel LLL algorithm
Sort
View
ASUNAM
2011
IEEE
12 years 10 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
CEC
2011
IEEE
12 years 10 months ago
Effective ranking + speciation = Many-objective optimization
—Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (th...
Mario Garza-Fabre, Gregorio Toscano Pulido, Carlos...
EGH
2011
Springer
12 years 10 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...
IACR
2011
136views more  IACR 2011»
12 years 10 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
SPAA
2004
ACM
14 years 3 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
« Prev « First page 1064 / 1226 Last » Next »