2944 search results - page 295 / 589 » Improving Bound Propagation |
215
click to vote
ASPLOS
2011
ACM
14 years 10 months ago
2011
ACM
Concurrency bugs are caused by non-deterministic interleavings between shared memory accesses. Their effects propagate through data and control dependences until they cause softwa...
168
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
171
click to vote
RTAS
2005
IEEE
16 years 8 days ago
2005
IEEE
Low-end embedded architectures, such as sensor nodes, have become popular in diverse fields, many of which impose real-time constraints. Currently, the Atmel Atmega processor fam...
174
click to vote
PODC
2005
ACM
16 years 7 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
202
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...