Sciweavers

740 search results - page 72 / 148
» FAST Extended Release
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 10 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 10 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
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,...
IROS
2007
IEEE
169views Robotics» more  IROS 2007»
14 years 4 months ago
A lightweight SLAM algorithm using Orthogonal planes for indoor mobile robotics
— Simple, fast and lightweight SLAM algorithms are necessary in many embedded robotic systems which soon will be used in houses and offices in order to do various service tasks....
Viet Nguyen, Ahad Harati, Roland Siegwart
ISQED
2007
IEEE
97views Hardware» more  ISQED 2007»
14 years 4 months ago
Probabilistic Congestion Prediction with Partial Blockages
— Fast and accurate routing congestion estimation is essential for optimizations such as floorplanning, placement, buffering, and physical synthesis that need to avoid routing c...
Zhuo Li, Charles J. Alpert, Stephen T. Quay, Sachi...