3055 search results - page 360 / 611 » Randomized Search Trees |
100
Voted
AIMSA
1990
Springer
15 years 7 months ago
1990
Springer
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
116
click to vote
COMAD
2008
15 years 5 months ago
2008
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
151
Voted
DMIN
2007
15 years 5 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
155
Voted
VMV
2001
15 years 5 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
135
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...