Sciweavers

1845 search results - page 264 / 369
» Computing the Angularity Tolerance
Sort
View
CHI
2004
ACM
14 years 10 months ago
Safety-critical interaction: usability in incidents and accidents
Recent years have seen an increasing use of sophisticated interaction techniques in the field of command and control systems. The use of such techniques has been required in order...
Philippe A. Palanque, Floor Koornneef, Chris Johns...
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 10 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
PPOPP
2010
ACM
14 years 7 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
CVPR
2010
IEEE
14 years 6 months ago
Boundary Learning by Optimization with Topological Constraints
Recent studies have shown that machine learning can improve the accuracy of detecting object boundaries in images. In the standard approach, a boundary detector is trained by mini...
Viren Jain, Benjamin Bollmann, Bobby Kasthuri, Ken...
ASPLOS
2010
ACM
14 years 4 months ago
Specifying and dynamically verifying address translation-aware memory consistency
Computer systems with virtual memory are susceptible to design bugs and runtime faults in their address translation (AT) systems. Detecting bugs and faults requires a clear speciï...
Bogdan F. Romanescu, Alvin R. Lebeck, Daniel J. So...