Sciweavers

968 search results - page 151 / 194
» A faster implementation of APlace
Sort
View
FIMI
2003
95views Data Mining» more  FIMI 2003»
15 years 5 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
USENIX
2001
15 years 5 months ago
Fast Indexing: Support for Size-Changing Algorithms in Stackable File Systems
Stackable file systems can provide extensible file system functionality with minimal performance overhead and development cost. However, previous approaches provide only limited f...
Erez Zadok, Johan M. Andersen, Ion Badulescu, Jaso...
IJCAI
2003
15 years 5 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
159
Voted
WOB
2004
120views Bioinformatics» more  WOB 2004»
15 years 5 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
158
Voted
WSCG
2003
170views more  WSCG 2003»
15 years 5 months ago
Hardware Accelerated Point Rendering of Isosurfaces
Interactive volume sculpting and volume editing often employ surface based visualization techniques, and interactive applications require fast generation and rendering of surface ...
J. Andreas Bærentzen, Niels Jørgen Ch...