Sciweavers

179 search results - page 17 / 36
» Distributed Algorithms for Constructing a Depth-First-Search...
Sort
View
PPOPP
2010
ACM
14 years 8 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,...
TCAD
2008
100views more  TCAD 2008»
13 years 10 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 2 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ý
SPAA
2004
ACM
14 years 4 months ago
A scalable lock-free stack algorithm
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
Danny Hendler, Nir Shavit, Lena Yerushalmi
ICDE
2009
IEEE
151views Database» more  ICDE 2009»
15 years 17 days ago
Decision Trees for Uncertain Data
Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information, which originates from...
Smith Tsang, Ben Kao, Kevin Y. Yip, Wai-Shing Ho, ...