Sciweavers

32545 search results - page 288 / 6509
» Data Structures and Algorithms
Sort
View
SPAA
2010
ACM
15 years 9 months ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
COMPGEOM
2006
ACM
15 years 10 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
141
Voted
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 7 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 8 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
ADG
2004
Springer
189views Mathematics» more  ADG 2004»
15 years 9 months ago
nD Polyhedral Scene Reconstruction from Single 2D Line Drawing by Local Propagation
In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general nD polyhedral scene from a single 2D line drawing. With the ide...
Hongbo Li