Sciweavers

819 search results - page 78 / 164
» Parallelization with Tree Skeletons
Sort
View
CHES
2007
Springer
111views Cryptology» more  CHES 2007»
15 years 4 months ago
TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks
Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay r...
Reouven Elbaz, David Champagne, Ruby B. Lee, Lione...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 1 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 4 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
AOSD
2007
ACM
15 years 1 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
ARITH
2007
IEEE
15 years 4 months ago
A New Family of High.Performance Parallel Decimal Multipliers
This paper introduces two novel architectures for parallel decimal multipliers. Our multipliers are based on a new algorithm for decimal carry–save multioperand addition that us...
Álvaro Vázquez, Elisardo Antelo, Pao...