Sciweavers

556 search results - page 52 / 112
» Fast parallel GPU-sorting using a hybrid algorithm
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
ASPDAC
2008
ACM
108views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Synthesis and design of parameter extractors for low-power pre-computation-based content-addressable memory using gate-block sel
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
Jui-Yuan Hsieh, Shanq-Jang Ruan
CVGIP
2010
182views more  CVGIP 2010»
13 years 8 months ago
MCCD: Multi-core collision detection between deformable models using front-based decomposition
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
Min Tang, Dinesh Manocha, Ruofeng Tong
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
14 years 26 days ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 3 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...