6437 search results - page 1122 / 1288 » Parallel Algorithms for Arrangements |
125
click to vote
IACR
2011
14 years 2 months ago
2011
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...
160
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
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...
132
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
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...
120
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
: 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....
163
click to vote
PODC
2012
ACM
13 years 5 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...